Defeasible logic versus Logic Programming without Negation as Failure
The paper presents a comparision of the expressive power of defeasible logic and Logic Programming without Negation as Failure (LPwNF). The difference between the approaches is discussed. The main difference is that LPwNF does not take into account teams of rules supporting a conclusion but rather views rules individually. The authors show that LPwNF fails to draw desirable conclusions that defeasible logic can. On the other hand, defeasible logic can prove everything that LPwNF can. Finally, they briefly compare defeasible logic with two further approaches, courteous logic programming and priority logic.
- Embedding defeasible logic into logic programming
- Defeasible logic programming: an argumentative approach
- Negation by default and unstratifiable logic programs
- scientific article; zbMATH DE number 1269578
- Embedding defeasible logic into logic programs
- Negation as failure for disjunctive logic programming
- scientific article; zbMATH DE number 4199654
- Negation as failure using tight derivations for general logic programs
- Logic programming with default, weak and strict negations
- scientific article; zbMATH DE number 4185010
This page was built for publication: Defeasible logic versus Logic Programming without Negation as Failure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934232)