Improved answer-set programming encodings for abstract argumentation
From MaRDI portal
Publication:4592988
DOI10.1017/S1471068415000149zbMATH Open1379.68292arXiv1507.06689MaRDI QIDQ4592988
Sarah Alice Gaggl, Norbert Manthey, Johannes Wallner, Alessandro Ronca, Stefan Woltran
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1507.06689
Cites Work
- Title not available (Why is that?)
- Computing ideal sceptical argumentation
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- On the evaluation of argumentation formalisms
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Semi-stable semantics
- Coherence in finite argument systems.
- Complexity-sensitive decision procedures for abstract argumentation
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Graph theoretical structures in logic programs and default theories
- Complex optimization in answer set programming
- Applications of declarative programming and knowledge management. 19th international conference, INAP 2011, and 25th workshop on logic programming, WLP 2011, Vienna, Austria, September 28--30, 2011. Revised selected papers
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- Logics in artificial intelligence. 11th European conference, JELIA 2008, Dresden, Germany, September 28--October 1, 2008. Proceedings
Cited In (11)
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
- Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change
- Initial sets in abstract argumentation frameworks
- Design and results of the second international competition on computational models of argumentation
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
- Paracoherent answer set computation
- Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
- Solving Advanced Argumentation Problems with Answer Set Programming
- Better Paracoherent Answer Sets with Less Resources
- On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach
This page was built for publication: Improved answer-set programming encodings for abstract argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592988)
