Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach

Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

45 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationTheory and Applications of Formal Argumentation
Subtitle of host publicationSecond International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected Papers
EditorsElizabeth Black, Sanjay Modgil, Nir Oren
Place of PublicationBerlin
PublisherSpringer Verlag
Pages176-193
Number of pages18
ISBN (Electronic)9783642543739
ISBN (Print)9783642543722
DOIs
Publication statusPublished - 2014
Event2nd International Workshop on Theory and Applications of Formal Argumentation - Beijing, China
Duration: 3 Aug 20135 Aug 2013
Conference number: 2

Publication series

NameTheory and Applications of Formal Argumentation
Volume8306
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Workshop

Workshop2nd International Workshop on Theory and Applications of Formal Argumentation
Abbreviated titleTAFA 13
CountryChina
CityBeijing
Period3/08/135/08/13

Fingerprint Dive into the research topics of 'Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach'. Together they form a unique fingerprint.

  • Cite this

    Cerutti, F., Dunne, P. E., Giacomin, M., & Vallati, M. (2014). Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach. In E. Black, S. Modgil, & N. Oren (Eds.), Theory and Applications of Formal Argumentation: Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected Papers (pp. 176-193). [Chapter 12] (Theory and Applications of Formal Argumentation; Vol. 8306). Berlin: Springer Verlag. https://doi.org/10.1007/978-3-642-54373-9_12