An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation

Federico Cerutti; Massimiliano Giacomin; Mauro Vallati; Marina Zanella

An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation

Federico Cerutti, Massimiliano Giacomin, Mauro Vallati, Marina Zanella

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can be instantiated with a specific "base algorithm", applied to the base case of the recursion, which can be obtained by generalizing existing algorithms in order to compute labellings in restricted sub-frameworks. We devise for this purpose a generalization of a SAT-based algorithm, and provide an empirical investigation to show the significant improvement of performances obtained by exploiting the SCCrecursive schema.

Original language	English
Title of host publication	14th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2014
Publisher	AAAI press
Pages	42-51
Number of pages	10
ISBN (Electronic)	9781577356578
Publication status	Published - 4 May 2014
Event	14th International Conference on the Principles of Knowledge Representation and Reasoning - Vienna, Austria Duration: 20 Jul 2014 → 24 Jul 2014 Conference number: 14 http://www.dbai.tuwien.ac.at/kr2014/ (Link to Conference Website)

Conference

Conference	14th International Conference on the Principles of Knowledge Representation and Reasoning
Abbreviated title	KR 2014
Country/Territory	Austria
City	Vienna
Period	20/07/14 → 24/07/14
Internet address	http://www.dbai.tuwien.ac.at/kr2014/ (Link to Conference Website)

Access to Document

https://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7974Licence: Unspecified

Cite this

@inproceedings{acd0d27321194af38cef6a6efc387640,

title = "An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation",

abstract = "This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can be instantiated with a specific {"}base algorithm{"}, applied to the base case of the recursion, which can be obtained by generalizing existing algorithms in order to compute labellings in restricted sub-frameworks. We devise for this purpose a generalization of a SAT-based algorithm, and provide an empirical investigation to show the significant improvement of performances obtained by exploiting the SCCrecursive schema.",

author = "Federico Cerutti and Massimiliano Giacomin and Mauro Vallati and Marina Zanella",

year = "2014",

month = may,

day = "4",

language = "English",

pages = "42--51",

booktitle = "14th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2014",

publisher = "AAAI press",

address = "United States",

note = "14th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2014 ; Conference date: 20-07-2014 Through 24-07-2014",

url = "http://www.dbai.tuwien.ac.at/kr2014/",

}

Cerutti, F, Giacomin, M, Vallati, M & Zanella, M 2014, An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation. in 14th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2014. AAAI press, pp. 42-51, 14th International Conference on the Principles of Knowledge Representation and Reasoning, Vienna, Austria, 20/07/14. <https://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7974>

An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation. / Cerutti, Federico; Giacomin, Massimiliano; Vallati, Mauro et al.

14th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2014. AAAI press, 2014. p. 42-51.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation

AU - Cerutti, Federico

AU - Giacomin, Massimiliano

AU - Vallati, Mauro

AU - Zanella, Marina

N1 - Conference code: 14

PY - 2014/5/4

Y1 - 2014/5/4

N2 - This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can be instantiated with a specific "base algorithm", applied to the base case of the recursion, which can be obtained by generalizing existing algorithms in order to compute labellings in restricted sub-frameworks. We devise for this purpose a generalization of a SAT-based algorithm, and provide an empirical investigation to show the significant improvement of performances obtained by exploiting the SCCrecursive schema.

AB - This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can be instantiated with a specific "base algorithm", applied to the base case of the recursion, which can be obtained by generalizing existing algorithms in order to compute labellings in restricted sub-frameworks. We devise for this purpose a generalization of a SAT-based algorithm, and provide an empirical investigation to show the significant improvement of performances obtained by exploiting the SCCrecursive schema.

UR - http://www.scopus.com/inward/record.url?scp=84962106715&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84962106715

SP - 42

EP - 51

BT - 14th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2014

PB - AAAI press

T2 - 14th International Conference on the Principles of Knowledge Representation and Reasoning

Y2 - 20 July 2014 through 24 July 2014

ER -

An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this