Computing and Library Services - delivering an inspiring information environment

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

Cerutti, Federico, Giacomin, Massimiliano, Vallati, Mauro and Zanella, Marina (2014) A SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation. In: 14th International Conference on Principles of Knowledge Representation and Reasoning (KR), 20th - 24th July 2014, Vienna, Austria.

[img] PDF - Published Version
Download (290kB)


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.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools: School of Computing and Engineering
Related URLs:
Depositing User: Mauro Vallati
Date Deposited: 10 Apr 2014 11:19
Last Modified: 28 Aug 2021 19:16


Downloads per month over past year

Repository Staff Only: item control page

View Item View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©