Solving Advanced Argumentation Problems with Answer Set Programming

DOI10.1017/S1471068419000474zbMath1472.68186arXiv1912.02734WikidataQ126343850 ScholiaQ126343850MaRDI QIDQ4957200

Thomas Linsbichler, Gerhard Brewka, Stefan Woltran, Georg Heissenberger, Martin Diller

Publication date: 3 September 2021

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.02734

zbMATH Keywords

encodingsADFASPGRAPPA

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items (3)

Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Lpopt: a rule optimization tool for answer set programming ⋮ Representing abstract dialectical frameworks with binary decision diagrams

Uses Software

• MiniSat
• DepQBF
• Clingo
• Datalog
• GRAPPA
• Lpopt
• DIAMOND
• selp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Argumentation in multi-agent systems. 8th international workshop, ArgMAS 2011, Taipei, Taiwan, May 3, 2011. Revised selected papers
• Using arguments for making and explaining decisions
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• 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
• Design and results of the second international competition on computational models of argumentation
• Multi-valued GRAPPA
• Methods for solving reasoning problems in abstract argumentation -- a survey
• From structured to abstract argumentation: assumption-based acceptance via AF reasoning
• Answer set programs with queries over subprograms
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• Lpopt: a rule optimization tool for answer set programming
• Complexity results for answer set programming with bounded predicate arities and implications
• Clause Elimination for SAT and QSAT
• Clingo goes linear constraints over reals and integers
• The power of non-ground rules in Answer Set Programming
• Stable-unstable semantics: Beyond NP with normal logic programs
• Judgment Aggregation in Abstract Dialectical Frameworks
• The DLV system for knowledge representation and reasoning
• Theory and Applications of Satisfiability Testing

This page was built for publication: Solving Advanced Argumentation Problems with Answer Set Programming