Computing preferred extensions in abstract argumentation : a SAT based approach

Cerutti, Federico, Dunne, Paul, Giacomin, Massimiliano and Vallati, Mauro (2014) Computing preferred extensions in abstract argumentation : a SAT based approach. In: 2nd International Workshop on Theory and Applications of Formal Argumentation (TAFA 13). Lecture Notes in Computer Science . Springer, Beijing, China, pp. 176-193. ISBN 9783642543722

PDF - Accepted Version Download (177kB)

Abstract

This paper presents a novel SAT-based approach for the computation
of extensions in abstract argumentation, with focus on preferred semantics, and
an empirical evaluation of its performances. The approach is based on the idea
of reducing the problem of computing complete extensions to a SAT problem
and then using a depth-first search method to derive preferred extensions. The
proposed approach has been tested using two distinct SAT solvers and compared
with three state-of-the-art systems for preferred extension computation. It turns
out that the proposed approach delivers significantly better performances in the
large majority of the considered cases.

Item Type:	Book Chapter
Subjects:	Q Science > Q Science (General) Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools:	School of Computing and Engineering School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
Related URLs:	Conference Publisher
Depositing User:	Mauro Vallati
Date Deposited:	18 Jul 2013 15:30
Last Modified:	01 Apr 2018 08:02
URI:	http://eprints.hud.ac.uk/id/eprint/17970

Downloads

Repository Staff Only: item control page

View Item