A Redefinition of Arguments in Defeasible Logic Programming

Defeasible Logic Programming (DELP) is a formal-ism 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 pro-cess. 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 pro-cess. We will discuss these alternative definitions and the cases in which they provide a better performance