Defeasible logic versus logic programming without negation as failure (2000) [46 citations — 17 self]
Abstract:
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. In this paper we compare the expressive power of two approaches in this family of logics: Defeasible Logic, and sceptical LPwNF. Our results show that the former has a strictly stronger expressive power. The difference is caused by the latter logic's failure to capture the idea of teams of rules supporting a specific conclusion.
Citations
| 120 | Defeasible logic – Nute - 1994 |
| 108 | A clash of intuitions: The current state of nonmonotonic multiple inheritance systems – Touretzky, Horty, et al. - 1987 |
| 71 | Nonmonotonic Reasoning – Antoniou - 1996 |
| 58 | Prioritized conflict handling for logic pro-grams – Grosof - 1997 |
| 55 | Logic programming without negation as failure – Dimopoulos, Kakas - 1995 |
| 51 | The acceptability semantics for logic programs – Kakas, Mancarella, et al. - 1994 |
| 47 | Defeasible logic is stable – Billington - 1993 |
| 44 | Defeasible Reasoning – Nute - 1987 |
| 23 | Normal forms for defeasible logic – Antoniou, Billington, et al. - 1998 |
| 22 | A Study of Provability in Defeasible Logic – Maher, Antoniou, et al. - 1998 |
| 10 | Logic programming without default negation revisited – Wang, You, et al. - 1997 |
| 9 | Nonmonotonic reasoning by monotonic inferences with priority constraints – Wang, You, et al. - 1997 |

