DeLP stands for Defeasible Logic Programming, a knowledge representation language, where defeasible and non-defeasible rules can be expressed. The language has two different negations: classical negation, used for representing contradictory knowledge and negation as failure, used for representing incomplete information. Defeasible reasoning is done using an argumentation formalism.

For a complete description of DeLP you can read the article Defeasible logic programming: An argumentative approach by by García & Simari published in TPLP 4(1) 2004.

More papers related to DeLP can be found on:
.: Guillermo R. Simari's home page
.: Alejandro García's home page

Sign in