Constrained Argumentation Frameworks

We present a generalization of Dung's theory of argumentation enabling to take account for some additional constraints on the admissible sets of arguments, expressed as a propositional formula over the set of arguments. We point out several semantics for such constrained argumentation frameworks, and compare the corresponding inference relations w.r.t. cautiousness. We show that our setting encompasses some previous approaches based on Dung's theory as specific cases. We also investigate the complexity issue for the inference relations in the extended setting. Interestingly, we show that our generalization does not lead to a complexity shift w.r.t. inference for several semantics.

[1]  Gerard Vreeswijk,et al.  Abstract Argumentation Systems , 1997, Artif. Intell..

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

[3]  Georg Gottlob,et al.  Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..

[4]  Antonis C. Kakas,et al.  Computing Argumentation in Logic Programming , 1999, J. Log. Comput..

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

[6]  Claudette Cayrol,et al.  A Reasoning Model Based on the Production of Acceptable Arguments , 2002, Annals of Mathematics and Artificial Intelligence.

[7]  Bernhard Nebel,et al.  On the computational complexity of assumption-based argumentation for default reasoning , 2002, Artif. Intell..

[8]  Pietro Baroni,et al.  Solving Semantic Problems with Odd-Length Cycles in Argumentation , 2003, ECSQARU.

[9]  Pietro Baroni,et al.  A recursive approach to argumentation: motivation and perspectives , 2004, NMR.

[10]  Claudette Cayrol,et al.  "Minimal defence": a refinement of the preferred semantics for argumentation frameworks , 2002, NMR.

[11]  John L. Pollock,et al.  How to Reason Defeasibly , 1992, Artif. Intell..

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

[13]  Pierre Marquis,et al.  Prudent semantics for argumentation frameworks , 2005, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05).

[14]  Henry Prakken,et al.  Logics for Defeasible Argumentation , 2001 .

[15]  Claudette Cayrol,et al.  From Non-Monotonic Syntax-Based Entailment to Preference-Based Argumentation , 1995, ECSQARU.

[16]  Claudette Cayrol,et al.  Gradual Valuation for Bipolar Argumentation Frameworks , 2005, ECSQARU.

[17]  Guillermo Ricardo Simari,et al.  A Mathematical Treatment of Defeasible Reasoning and its Implementation , 1992, Artif. Intell..

[18]  Pierre Marquis,et al.  Inference from Controversial Arguments , 2005, LPAR.

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

[20]  Philippe Besnard,et al.  Checking the acceptability of a set of arguments , 2004, NMR.

[21]  C. Cayrol,et al.  Gradual handling of contradiction in argumentation frameworks , 2003 .

[22]  Claudette Cayrol,et al.  On bipolarity in argumentation frameworks , 2008, NMR.

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

[24]  Paul J. Krause,et al.  Acceptability of arguments as 'logical uncertainty' , 1993, ECSQARU.

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

[26]  Claudette Cayrol,et al.  Inferring from Inconsistency in Preference-Based Argumentation Frameworks , 2002, Journal of Automated Reasoning.

[27]  Nadia Creignou,et al.  The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness , 1995, Theor. Comput. Sci..

[28]  Pietro Baroni,et al.  Extending abstract argumentation systems theory , 2000, Artif. Intell..

[29]  Paul J. Krause,et al.  Dialectic reasoning with inconsistent information , 1993, UAI.

[30]  Morten Elvang-Gøransson,et al.  Argumentative Logics: Reasoning with Classically Inconsistent Information , 1995, Data Knowl. Eng..

[31]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[32]  Phan Minh Dung,et al.  An Abstract, Argumentation-Theoretic Approach to Default Reasoning , 1997, Artif. Intell..