A review of current defeasible reasoning implementations

This article surveys existing practical implementations of both defeasible and argumentation-based reasoning engines and associated literature. We aim to summarize the current state of the art in the research area, show that there are many similiarities and connections between the various implementations and also highlight the differences regarding evaluation goals and strategies. An important goal of this paper is to argue for the need for well-designed empirical evaluations, as well as formal complexity analysis, in order to justify the practical applicability of a reasoning engine. There are indeed many challenges to be faced in developing implementations of argumentation. Not least of these is the inherent computational complexity of the formal models. We cover some of the ways these challenges have been addressed, and provide pointers for future directions in realizing the goal of practical argumentation.

[1]  Rolf Haenni,et al.  Cost-bounded argumentation , 2001, Int. J. Approx. Reason..

[2]  Dorian Gaertner,et al.  CaSAPI : a system for credulous and sceptical argumentation , 2007 .

[3]  David Billington,et al.  Propositional Plausible Logic: Introduction and Implementation , 2001, Stud Logica.

[4]  Donald Nute,et al.  Defeasible reasoning and decision support systems , 1988, Decis. Support Syst..

[5]  Victor W. Marek,et al.  Computing with Default Logic , 1999, Artif. Intell..

[6]  Gerard A. W. Vreeswijk.  IACAS: an interactive argumentation system , 1994 .

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

[8]  Andrea Omicini,et al.  Multi-paradigm Java-Prolog integration in tuProlog , 2005, Sci. Comput. Program..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[11]  Michael J. Maher,et al.  Efficient Defeasible Reasoning Systems , 2001, Int. J. Artif. Intell. Tools.

[12]  José Júlio Alferes,et al.  Reasoning with Logic Programming , 1996, Lecture Notes in Computer Science.

[13]  Ana Gabriela Maguitman,et al.  ArgueNet: an argument-based recommender system for solving Web search queries , 2004, 2004 2nd International IEEE Conference on 'Intelligent Systems'. Proceedings (IEEE Cat. No.04EX791).

[15]  Roderick M. Chisholm,et al.  Theory of Knowledge , 1989 .

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

[17]  Robert A. Kowalski,et al.  Algorithm = logic + control , 1979, CACM.

[18]  Robert L. Causey,et al.  EVID: A system for interactive defeasible reasoning , 1994, Decis. Support Syst..

[19]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[20]  Guillermo Ricardo Simari,et al.  An analysis of the computational complexity of DeLP through game semantics , 2005 .

[21]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[22]  Guillermo Ricardo Simari,et al.  Dialectical Explanations in Defeasible Argumentation , 2007, ECSQARU.

[23]  Donald Nute,et al.  Defeasible Logic , 1994, INAP.

[24]  David Billington,et al.  An implementation of propositional plausible logic , 2000, Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518).

[25]  E. Shortliffe.  Mycin: computer-based medical consultations , 1976 .

[26]  Guillermo Ricardo Simari,et al.  Argumentation and the Dynamics of Warranted Beliefs in Changing Environments , 2005, Autonomous Agents and Multi-Agent Systems.

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

[28]  Gerard Vreeswijk,et al.  IACAS: an implementation of Chisolm''s Principles of Knowledge , 1995 .

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

[30]  Paul J. Krause,et al.  An Implementation of a Lightweight Argumentation Engine for Agent Applications , 2006, JELIA.

[31]  Bernhard Nebel,et al.  Finding Admissible and Preferred Arguments Can be Very Hard , 2000, KR.

[32]  George Boolos,et al.  Computability and logic , 1974 .

[33]  Miquel Sànchez-Marrè,et al.  CBR and Argument Schemes for Collaborative Decision Making , 2006, COMMA.

[34]  Dirk Vermeir,et al.  Dialectic semantics for argumentation frameworks , 1999, ICAIL '99.

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

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

[37]  Guillermo Ricardo Simari,et al.  An Argument-Based Framework to Model an Agent's Beliefs in a Dynamic Environment , 2004, ArgMAS.

[38]  Dov M. Gabbay,et al.  Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning , 1994 .

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

[40]  Grigoris Antoniou,et al.  Nonmonotonic Reasoning and Logic Programming , 1997 .

[41]  Grigoris Antoniou,et al.  DR-Prolog: A System for Defeasible Reasoning with Rules and Ontologies on the Semantic Web , 2007, IEEE Transactions on Knowledge and Data Engineering.

[42]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[43]  Yannis Dimopoulos,et al.  Graph theoretical structures in logic programs and default theories , 1996 .

[44]  Michael Schroeder,et al.  An Efficient Argumentation Framework for Negtiating Autonomous Agents , 1999, MAAMAW.

[45]  Guillermo Ricardo Simari,et al.  Deliberative Stock Market Agents using Jinni and Defeasible Logic Programming , 2000 .

[46]  Michael J. Maher,et al.  Representation results for defeasible logic , 2000, TOCL.

[47]  Guillermo Ricardo Simari,et al.  Pruning Search Space in Defeasible Argumentation , 2004, cs/0405106.

[48]  Dov M. Gabbay,et al.  Handbook of Philosophical Logic , 2002 .

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

[50]  Andrea Omicini,et al.  tu Prolog: A Light-Weight Prolog for Internet Applications and Infrastructures , 2001, PADL.

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

[52]  Gerard Vreeswijk,et al.  Argue tuProlog: A Lightweight Argumentation Engine for Agent Applications , 2006, COMMA.

[53]  Donald Nute,et al.  Controlling expert system recommendations with defeasible logic , 1990, Decis. Support Syst..

[54]  John L. Pollock,et al.  Rational Cognition in OSCAR , 1999, ATAL.

[55]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[56]  John W. Lloyd,et al.  Foundations of Logic Programming, 1st Edition , 1984 .

[57]  Andrew Rock.  Deimos: Query answering defeasible logic system , 2000 .

[58]  Paul Tarau,et al.  Jinni: Intelligent Mobile Agent Programming at the Intersection of Java and Prolog , 1999 .

[59]  Andrew S. Merrill,et al.  A design for reasoning with policies, precedents, and rationales , 1993, ICAIL '93.

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

[61]  Guillermo Ricardo Simari,et al.  Parallel defeasible argumentation , 2000 .

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

[63]  Claudette Cayrol,et al.  On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks , 2003, J. Log. Comput..

[64]  Robert L. Causey,et al.  Computational Dialogic Defeasible Reasoning , 2003 .

[65]  Gerard Vreeswijk.  An algorithm to compute minimally grounded and admissible defence sets in argument systems , 2006, COMMA.

[66]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[67]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[68]  J. Pollock.  Cognitive Carpentry: A Blueprint for How to Build a Person , 1995 .

[69]  Claudette Cayrol,et al.  Dialectical Proof Theories for the Credulous Preferred Semantics of Argumentation Frameworks , 2001, ECSQARU.

[70]  Michael A. Covington,et al.  Logical control of an elevator with defeasible logic , 2000, IEEE Trans. Autom. Control..

[71]  Y. Shoham,et al.  Empirical approach to the complexity of hard problems , 2005 .

[72]  Henri Prade,et al.  Using Arguments for Making Decisions: A Possibilistic Logic Approach , 2004, UAI.

[73]  Introducing dialectical bases in defeasible argumentation , 1999 .