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

43 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

Semantics

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
Cerutti, Federico ; Dunne, Paul E. ; Giacomin, Massimiliano ; Vallati, Mauro. / Computing Preferred Extensions in Abstract Argumentation : A SAT-Based Approach. Theory and Applications of Formal Argumentation: Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected Papers. editor / Elizabeth Black ; Sanjay Modgil ; Nir Oren. Berlin : Springer Verlag, 2014. pp. 176-193 (Theory and Applications of Formal Argumentation).
@inproceedings{3972fc5f76f94f6a9897f232fdcd7433,
title = "Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach",
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.",
keywords = "abstract argumentation",
author = "Federico Cerutti and Dunne, {Paul E.} and Massimiliano Giacomin and Mauro Vallati",
year = "2014",
doi = "10.1007/978-3-642-54373-9_12",
language = "English",
isbn = "9783642543722",
series = "Theory and Applications of Formal Argumentation",
publisher = "Springer Verlag",
pages = "176--193",
editor = "Elizabeth Black and Sanjay Modgil and Nir Oren",
booktitle = "Theory and Applications of Formal Argumentation",
address = "Germany",

}

Cerutti, F, Dunne, PE, 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., Chapter 12, Theory and Applications of Formal Argumentation, vol. 8306, Springer Verlag, Berlin, pp. 176-193, 2nd International Workshop on Theory and Applications of Formal Argumentation, Beijing, China, 3/08/13. https://doi.org/10.1007/978-3-642-54373-9_12

Computing Preferred Extensions in Abstract Argumentation : A SAT-Based Approach. / Cerutti, Federico; Dunne, Paul E.; Giacomin, Massimiliano; Vallati, Mauro.

Theory and Applications of Formal Argumentation: Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected Papers. ed. / Elizabeth Black; Sanjay Modgil; Nir Oren. Berlin : Springer Verlag, 2014. p. 176-193 Chapter 12 (Theory and Applications of Formal Argumentation; Vol. 8306).

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

TY - GEN

T1 - Computing Preferred Extensions in Abstract Argumentation

T2 - A SAT-Based Approach

AU - Cerutti, Federico

AU - Dunne, Paul E.

AU - Giacomin, Massimiliano

AU - Vallati, Mauro

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - abstract argumentation

U2 - 10.1007/978-3-642-54373-9_12

DO - 10.1007/978-3-642-54373-9_12

M3 - Conference contribution

SN - 9783642543722

T3 - Theory and Applications of Formal Argumentation

SP - 176

EP - 193

BT - Theory and Applications of Formal Argumentation

A2 - Black, Elizabeth

A2 - Modgil, Sanjay

A2 - Oren, Nir

PB - Springer Verlag

CY - Berlin

ER -

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