Defeasible logic versus Logic Programming without Negation as Failure (Q4934232)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1389813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Defeasible logic versus Logic Programming without Negation as Failure |
scientific article; zbMATH DE number 1389813 |
Statements
Defeasible logic versus Logic Programming without Negation as Failure (English)
0 references
6 May 2001
0 references
defeasible logic
0 references
0.9079937
0 references
0.90703404
0 references
0.9053633
0 references
0.90146685
0 references
0.90014094
0 references
0.8998325
0 references
0.8964102
0 references
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.
0 references