Abstract
This paper presents a metaalgorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCCRecursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted subframeworks, in order to reduce the computational effort. The metaalgorithm 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 subframeworks. We devise for this purpose a generalization of a SATbased 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  4251 
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  Austria 
City  Vienna 
Period  20/07/14 → 24/07/14 
Internet address 

Fingerprint
Cite this
}
An SCC Recursive MetaAlgorithm for Computing Preferred Labellings in Abstract Argumentation. / Cerutti, Federico; Giacomin, Massimiliano; Vallati, Mauro; Zanella, Marina.
14th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2014. AAAI press, 2014. p. 4251.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY  GEN
T1  An SCC Recursive MetaAlgorithm for Computing Preferred Labellings in Abstract Argumentation
AU  Cerutti, Federico
AU  Giacomin, Massimiliano
AU  Vallati, Mauro
AU  Zanella, Marina
PY  2014/5/4
Y1  2014/5/4
N2  This paper presents a metaalgorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCCRecursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted subframeworks, in order to reduce the computational effort. The metaalgorithm 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 subframeworks. We devise for this purpose a generalization of a SATbased algorithm, and provide an empirical investigation to show the significant improvement of performances obtained by exploiting the SCCrecursive schema.
AB  This paper presents a metaalgorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCCRecursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted subframeworks, in order to reduce the computational effort. The metaalgorithm 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 subframeworks. We devise for this purpose a generalization of a SATbased 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
ER 