Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas

dialectical frameworks (ADFs) constitute a recent and powerful generalisation of Dung’s argumentation frameworks (AFs), where the relationship between the arguments can be specified via Boolean formulas. Recent results have shown that this enhancement comes with the price of higher complexity compared to AFs. In fact, acceptance problems in the world of ADFs can be hard even for the third level of the polynomial hierarchy. In order to implement reasoning problems on ADFs, systems for quantified Boolean formulas (QBFs) thus are suitable engines to be employed. In this paper we give complexity sensitive QBF encodings of ADF problems generalising recent work on QBFs for AF labellings. Our encodings provide a uniform and modular way of translating reasoning in ADFs to QBFs, that can be used as the basis for novel systems for ADF reasoning.

[1]  Jussi Rintanen,et al.  Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

[2]  Hannes Strass,et al.  Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory , 2015, Artif. Intell..

[3]  Sanjit A. Seshia,et al.  Convergence Testing in Term-Level Bounded Model Checking , 2003, CHARME.

[4]  Stefan Woltran,et al.  Complexity-sensitive decision procedures for abstract argumentation , 2012, Artif. Intell..

[5]  Trevor J. M. Bench-Capon,et al.  Coherence in finite argument systems , 2002, Artif. Intell..

[6]  C. Cayrol,et al.  On the Acceptability of Arguments in Bipolar Argumentation Frameworks , 2005, ECSQARU.

[7]  Stefan Woltran,et al.  Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas , 2006, COMMA.

[8]  Stefan Woltran,et al.  Generalizations of Dung Frameworks and Their Role in Formal Argumentation , 2014, IEEE Intelligent Systems.

[9]  Martin Caminada,et al.  A QBF-based formalization of abstract argumentation semantics , 2013, J. Appl. Log..

[10]  John Martin,et al.  A History of Satisfiability , 2009, Handbook of Satisfiability.

[11]  Massimiliano Giacomin,et al.  An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation , 2014, KR.

[12]  Florian Lonsing,et al.  Incremental QBF Solving , 2014, CP.

[13]  Stefan Woltran,et al.  Methods for solving reasoning problems in abstract argumentation – A survey , 2015, Artif. Intell..

[14]  Karem A. Sakallah,et al.  Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution , 2003, SAT.

[15]  Stefan Ellmauthaler.  Abstract Dialectical Frameworks ∗ Properties , Complexity , and Implementation , 2012 .

[16]  Hannes Strass,et al.  The DIAMOND System for Computing with Abstract Dialectical Frameworks , 2014, COMMA.

[17]  Trevor J. M. Bench-Capon.  Persuasion in Practical Argument Using Value-based Argumentation Frameworks , 2003, J. Log. Comput..

[18]  Armin Biere,et al.  DepQBF: A Dependency-Aware QBF Solver , 2010, J. Satisf. Boolean Model. Comput..

[19]  Hannes Strass,et al.  The DIAMOND System for Argumentation: Preliminary Report , 2013, ArXiv.

[20]  Dov M. Gabbay,et al.  A Logical Account of Formal Argumentation , 2009, Stud Logica.

[21]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[22]  Stephen Dean Brown,et al.  FPGA Logic Synthesis Using Quantified Boolean Satisfiability , 2005, SAT.

[23]  Hans Kleine Büning,et al.  Theory of Quantified Boolean Formulas , 2021, Handbook of Satisfiability.

[24]  Hannes Strass.  Approximating operators and semantics for abstract dialectical frameworks , 2013, Artif. Intell..

[25]  Stefan Woltran,et al.  Abstract Dialectical Frameworks , 2010, KR.

[26]  Enrico Giunchiglia,et al.  Reasoning with Quantified Boolean Formulas , 2021, Handbook of Satisfiability.

[27]  Armando Tacchella,et al.  Quantifier Structure in Search-Based Procedures for QBFs , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[28]  Pietro Baroni,et al.  AFRA: Argumentation framework with recursive attacks , 2011, Int. J. Approx. Reason..

[29]  Marco Benedetti,et al.  QBF-Based Formal Verification: Experience and Perspectives , 2008, J. Satisf. Boolean Model. Comput..

[30]  Enrico Giunchiglia,et al.  Planning as Satisfiability in Nondeterministic Domains , 2000, AAAI/IAAI.

[31]  Armin Biere,et al.  Blocked Clause Elimination for QBF , 2011, CADE.

[32]  Stefan Woltran,et al.  Implementing Abstract Argumentation - A Survey , 2013 .

[33]  Massimiliano Giacomin,et al.  Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach , 2013, TAFA.

[34]  Hannes Strass,et al.  Abstract Dialectical Frameworks Revisited , 2013, IJCAI.

[35]  Martin Diller,et al.  Reasoning in abstract dialectical frameworks using quantified Boolean formulas , 2015, Argument Comput..

[36]  Stefan Woltran,et al.  Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas , 2000, AAAI/IAAI.