On the Intertranslatability of Argumentation Semantics

Translations between different nonmonotonic formalisms always have been an important topic in the field, in particular to understand the knowledge-representation capabilities those formalisms offer. We provide such an investigation in terms of different semantics proposed for abstract argumentation frameworks, a nonmonotonic yet simple formalism which received increasing interest within the last decade. Although the properties of these different semantics are nowadays well understood, there are no explicit results about intertranslatability. We provide such translations wrt. different properties and also give a few novel complexity results which underlie some negative results.

[1]  Dov M. Gabbay,et al.  Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming , 2009, Stud Logica.

[2]  Pavlos Moraitis,et al.  A unified and general framework for argumentation-based negotiation , 2007, AAMAS '07.

[3]  Pietro Baroni,et al.  Semantics of Abstract Argument Systems , 2009, Argumentation in Artificial Intelligence.

[4]  Ringo Baumann,et al.  Expanding Argumentation Frameworks: Enforcing and Monotonicity Results , 2010, COMMA.

[5]  Georg Gottlob,et al.  Translating default logic into standard autoepistemic logic , 1995, JACM.

[6]  Tomasz Imielinski,et al.  Results on Translating Defaults to Circumscription , 1985, IJCAI.

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

[8]  Pablo Noriega,et al.  A Framework for Argumentation-Based Negotiation , 1997, ATAL.

[9]  Jia-Huai You,et al.  Unfolding partiality and disjunctions in stable model semantics , 2000, TOCL.

[10]  Trevor J. M. Bench-Capon,et al.  Argumentation in AI and Law: Editors' Introduction , 2005, Artificial Intelligence and Law.

[11]  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..

[12]  Pietro Baroni,et al.  On the resolution-based family of abstract argumentation semantics and its grounded instance , 2011, Artif. Intell..

[13]  Claudette Cayrol,et al.  Bipolar abstract argumentation systems , 2009, Argumentation in Artificial Intelligence.

[14]  Martin Caminada,et al.  On the evaluation of argumentation formalisms , 2007, Artif. Intell..

[15]  Pietro Baroni,et al.  Resolution-based argumentation semantics , 2008, COMMA.

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

[17]  Martin Caminada,et al.  Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks , 2008, JELIA.

[18]  Yannis Dimopoulos,et al.  Graph Theoretical Structures in Logic Programs and Default Theories , 1996, Theor. Comput. Sci..

[19]  D. M. Gabbaya.  Equational approach to argumentation networks , 2012 .

[20]  Anthony Hunter,et al.  A logic-based theory of deductive arguments , 2001, Artif. Intell..

[21]  Pierre Marquis,et al.  Symmetric Argumentation Frameworks , 2005, ECSQARU.

[22]  David Pearce.  The Gödel and the Splitting Translations , 2010, NMR 2010.

[23]  Victor W. Marek,et al.  Uniform semantic treatment of default and autoepistemic logics , 2000, Artif. Intell..

[24]  Bart Verheij,et al.  Two Approaches to Dialectical Argumentation: Admissible Sets and Argumentation Stages , 1999 .

[25]  Tomi Janhunen,et al.  On the intertranslatability of non‐monotonic logics , 1999, Annals of Mathematics and Artificial Intelligence.

[26]  Dov M. Gabbay,et al.  Fibring Argumentation Frames , 2009, Stud Logica.

[27]  Paolo Mancarella,et al.  Computing ideal sceptical argumentation , 2007, Artif. Intell..

[28]  Stefan Woltran,et al.  Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs , 2011, IJCAI.

[29]  Stefan Woltran,et al.  Complexity of semi-stable and stage semantics in argumentation frameworks , 2010, Inf. Process. Lett..

[30]  Torsten Schaub,et al.  Expressing Default Logic Variants in Default Logic , 2005, J. Log. Comput..

[31]  Trevor J. M. Bench-Capon,et al.  Metalevel argumentation , 2011, J. Log. Comput..

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

[33]  Pietro Baroni,et al.  SCC-recursiveness: a general schema for argumentation semantics , 2005, Artif. Intell..

[34]  Jos de Bruijn,et al.  Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic , 2008, KR.

[35]  Trevor J. M. Bench-Capon,et al.  Abstract Argumentation and Values , 2009, Argumentation in Artificial Intelligence.

[36]  Sanjay Modgil,et al.  Reasoning about preferences in argumentation frameworks , 2009, Artif. Intell..

[37]  Kurt Konolige,et al.  On the Relation Between Default and Autoepistemic Logic , 1987, Artif. Intell..

[38]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[39]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[40]  Paul E. Dunne,et al.  Semi-stable semantics , 2006, J. Log. Comput..

[41]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.