Complexity of logic-based argumentation in Post's framework

Many proposals for logic-based formalisations of argumentation consider an argument as a pair (Φ,α), where the support Φ is understood as a minimal consistent subset of a given knowledge base which ...

[1]  Ana Gabriela Maguitman,et al.  Logical models of argument , 2000, CSUR.

[2]  Michael Thomas,et al.  Complexity of Propositional Abduction for Restricted Sets of Boolean Functions , 2009, KR.

[3]  Harry R. Lewis,et al.  Satisfiability problems for propositional calculi , 1979, Mathematical systems theory.

[4]  Anthony Hunter,et al.  Instantiating abstract argumentation with classical logic arguments: Postulates and properties , 2011, Artif. Intell..

[5]  Heribert Vollmer,et al.  The Complexity of Generalized Satisfiability for Linear Temporal Logic , 2006, Electron. Colloquium Comput. Complex..

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

[7]  Michael Wooldridge,et al.  Properties and Complexity of Some Formal Inter-agent Dialogues , 2003, J. Log. Comput..

[8]  Christos H. Papadimitriou,et al.  The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Arnaud Durand,et al.  On the counting complexity of propositional circumscription , 2008, Inf. Process. Lett..

[10]  Robin Hirsch,et al.  The Complexity of the Warranted Formula Problem in Propositional Argumentation , 2010, J. Log. Comput..

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

[12]  Michael Wooldridge,et al.  On the Complexity of Linking Deductive and Abstract Argument Systems , 2006, AAAI.

[13]  Guillermo Ricardo Simari,et al.  Defeasible logic programming: an argumentative approach , 2003, Theory and Practice of Logic Programming.

[14]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

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

[16]  Anthony Hunter,et al.  Elements of Argumentation , 2007, ECSQARU.

[17]  Claudette Cayrol,et al.  On the Relation between Argumentation and Non-monotonic Coherence-Based Entailment , 1995, IJCAI.

[18]  Phan Minh Dung,et al.  Dialectic proof procedures for assumption-based, admissible argumentation , 2006, Artif. Intell..

[19]  Pietro Baroni,et al.  On Extension Counting Problems in Argumentation Frameworks , 2010, COMMA.

[20]  Emil L. Post.  The two-valued iterative systems of mathematical logic , 1942 .

[21]  Edith Hemaspaandra,et al.  Generalized modal satisfiability , 2010, J. Comput. Syst. Sci..

[22]  Reinhard Pichler,et al.  Counting Complexity of Propositional Abduction , 2007, IJCAI.

[23]  Philippe Besnard,et al.  A Formal Analysis of Logic-Based Argumentation Systems , 2010, SUM.

[24]  Heribert Vollmer,et al.  The satanic notations , 1995, SIGACT News.

[25]  Heribert Vollmer,et al.  Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help? , 2008, Complexity of Constraints.

[26]  Gustav Nordh,et al.  What makes propositional abduction tractable , 2008, Artif. Intell..

[27]  Nadia Creignou,et al.  A Complete Classification of the Complexity of Propositional Abduction , 2006, SIAM J. Comput..

[28]  Georg Gottlob,et al.  The Complexity of Logic-Based Abduction , 1993, STACS.

[29]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[30]  Michael Thomas.  The Complexity of Circumscriptive Inference in Post’s Lattice , 2010, Theory of Computing Systems.

[31]  Phokion G. Kolaitis,et al.  Subtractive reductions and complete problems for counting complexity classes , 2000 .

[32]  Steffen Reith.  On the Complexity of Some Equivalence Problems for Propositional Calculi , 2003, MFCS.

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

[34]  Arne Meier,et al.  The complexity of propositional implication , 2008, Inf. Process. Lett..

[35]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[36]  Phokion G. Kolaitis,et al.  Subtractive reductions and complete problems for counting complexity classes , 2005, Theor. Comput. Sci..

[37]  Henning Schnoor September.  The Complexity of the Boolean Formula Value Problem , 2005 .

[38]  Trevor J. M. Bench-Capon,et al.  Argumentation in artificial intelligence , 2007, Artif. Intell..