A Redefinition of Arguments in Defeasible Logic Programming

Defeasible Logic Programming (DELP) is a formalism that extends declarative programming to capture defeasible reasoning. Its inference mechanism, upon a query on a literal in a program, answers by indicating whether or not it is warranted in an argumentation process. While the properties of DELP are well known, some of its basic elements can be redefined in order to shed light on some of the subtleties of the warrant process. We will discuss these alternative definitions and the cases in which they provide a better performance.

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

[2]  Guillermo Ricardo Simari,et al.  Computing Generalized Specificity , 2003, J. Appl. Non Class. Logics.

[3]  Guillermo Ricardo Simari,et al.  Explanations, belief revision and defeasible reasoning , 2002, Artif. Intell..

[4]  Guillermo Ricardo Simari,et al.  Formalizing defeasible argumentation using a labeled deductive system , 2001 .

[5]  Jürgen Dix,et al.  Relating defeasible and normal logic programming through transformation properties , 2000, Theor. Comput. Sci..

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

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

[8]  Guillermo Ricardo Simari,et al.  An Alternative Foundation for DeLP: Defeating Relations and Truth Values , 2008, FoIKS.

[9]  Alejandro Javier García.  Defeasible logic programming: language definition, operational semantics, and parallelism , 2001 .

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

[11]  Guillermo Ricardo Simari,et al.  Negotiation Among DDeLP Agents , 2004, ArgMAS.

[12]  Guillermo Ricardo Simari,et al.  Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification , 2008, Int. J. Approx. Reason..