Hostname: page-component-6898cfcb55-th4rj Total loading time: 0 Render date: 2026-11-11T18:44:22.629Z Has data issue: false hasContentIssue false

Improved answer-set programming encodings for abstract argumentation

Published online by Cambridge University Press:  03 September 2015

SARAH A. GAGGL
Affiliation:
Technische Universität Dresden, Germany
NORBERT MANTHEY
Affiliation:
Technische Universität Dresden, Germany
ALESSANDRO RONCA
Affiliation:
La Sapienza, University of Rome
JOHANNES P. WALLNER
Affiliation:
University of Helsinki, Department of Computer Science, HIIT
STEFAN WOLTRAN
Affiliation:
Vienna University of Technology, Austria
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set Programming (ASP) for this endeavor. In this paper, we present new encodings for three prominent argumentation semantics using the concept of conditional literals in disjunctions as provided by the ASP-system clingo. Our new encodings are not only more succinct than previous versions, but also outperform them on standard benchmarks.

Information

Type
Regular Papers
Copyright
Copyright © Cambridge University Press 2015 
Supplementary material: PDF

Gaggl supplementary material

Online Appendix

Download Gaggl supplementary material(PDF)
PDF 220.6 KB