Bilattices and the semantics of logic programming
Journal of Logic Programming
A survey of paraconsistent semantics for logic programs
Handbook of defeasible reasoning and uncertainty management systems
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Ordering default theories and nonmonotonic logic programs
Theoretical Computer Science
Application of default logic in an intelligent tutoring system
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
Non-classical logic in an intelligent assessment sub-system
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Hi-index | 0.00 |
In first-order logic, a theory T1 is considered stronger than another theory T2 if every formula derived from T2 is also derived from T1. Such an order relation is useful to know relative value between different theories. In the context of default logic, a theory contains default information as well as definite information. To order default theories, it is necessary to assess the information content of a default theory. To this end, we introduce a multi-valued interpretation of default theories based on a nine-valued bilattice. It distinguishes definite and credulous/skeptical default information derived from a theory, and is used for ordering default theories based on their information contents. The technique is also applied to order nonmonotonic logic programs. The results of this paper provide a method for comparing different default theories and have important application to learning nonmonotonic theories.