Solving Advanced Argumentation Problems with Answer Set Programming
From MaRDI portal
Abstract: Powerful formalisms for abstract argumentation have been proposed, among them abstract dialectical frameworks (ADFs) that allow for a succinct and flexible specification of the relationship between arguments, and the GRAPPA framework which allows argumentation scenarios to be represented as arbitrary edge-labelled graphs. The complexity of ADFs and GRAPPA is located beyond NP and ranges up to the third level of the polynomial hierarchy. The combined complexity of Answer Set Programming (ASP) exactly matches this complexity when programs are restricted to predicates of bounded arity. In this paper, we exploit this coincidence and present novel efficient translations from ADFs and GRAPPA to ASP. More specifically, we provide reductions for the five main ADF semantics of admissible, complete, preferred, grounded, and stable interpretations, and exemplify how these reductions need to be adapted for GRAPPA for the admissible, complete and preferred semantics. Under consideration in Theory and Practice of Logic Programming (TPLP).
Recommendations
- Argumentation and answer set programming
- Representing argumentation frameworks in answer set programming
- Answer-set programming encodings for argumentation frameworks
- Towards a general argumentation system based on answer-set programming
- Improved answer-set programming encodings for abstract argumentation
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 6928628 (Why is no real title available?)
- scientific article; zbMATH DE number 7166765 (Why is no real title available?)
- scientific article; zbMATH DE number 6747882 (Why is no real title available?)
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Answer set programs with queries over subprograms
- Argumentation in multi-agent systems. 8th international workshop, ArgMAS 2011, Taipei, Taiwan, May 3, 2011. Revised selected papers
- Clause elimination for SAT and QSAT
- Clingo goes linear constraints over reals and integers
- Complexity results for answer set programming with bounded predicate arities and implications
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- Design and results of the second international competition on computational models of argumentation
- From structured to abstract argumentation: assumption-based acceptance via AF reasoning
- Judgment aggregation in abstract dialectical frameworks
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Multi-valued GRAPPA
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the computational cost of disjunctive logic programming: Propositional case
- Stable-unstable semantics: Beyond NP with normal logic programs
- The DLV system for knowledge representation and reasoning
- The power of non-ground rules in Answer Set Programming
- Theory and Applications of Satisfiability Testing
- Using arguments for making and explaining decisions
Cited in
(11)- Argumentation and answer set programming
- Towards a general argumentation system based on answer-set programming
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- Classical computation over quantum architectures. From graph encoding to declarative languages compilation
- Abstract argumentation frameworks with strong and weak constraints
- Representing argumentation frameworks in answer set programming
- Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
- Improved answer-set programming encodings for abstract argumentation
- On acceptance conditions in abstract argumentation frameworks
- Representing abstract dialectical frameworks with binary decision diagrams
- Answer-set programming encodings for argumentation frameworks
This page was built for publication: Solving Advanced Argumentation Problems with Answer Set Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957200)
