Journal
JOURNAL OF LOGIC PROGRAMMING
Volume 42, Issue 1, Pages 47-57Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/S0743-1066(99)00060-6
Keywords
defeasible logic; logic programming
Categories
Ask authors/readers for more resources
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 Logic Programming without Negation as Failure (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. (C) 2000 Published by Elsevier Science Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available