Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Advances in Inductive Logic Programming
Advances in Inductive Logic Programming
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
ILP '98 Proceedings of the 8th International Workshop on Inductive Logic Programming
Normal Programs and Multiple Predicate Learning
ILP '98 Proceedings of the 8th International Workshop on Inductive Logic Programming
Some Properties of Invers Resolution in Normal Logic Programs
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
Which Hypotheses Can Be Found with Inverse Entailment?
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
Learning Non-Monotonic Logic Programs: Learning Exceptions
ECML '95 Proceedings of the 8th European Conference on Machine Learning
Learning extended logic programs
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Nonmonotonic logics: meaning and utility
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Towards the Integration of Inductive and Nonmonotonic Logic Programming
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
ILP '01 Proceedings of the 11th International Conference on Inductive Logic Programming
ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
| Hi-index | 0.00 |
Inverse entailment (IE) is known as a technique for finding inductive hypotheses in Horn theories. When a background theory is nonmonotonic, however, IE is not applicable in its present form. The purpose of this paper is extending the IE technique to nonmonotonic inductive logic programming (ILP). To this end, we first establish a new entailment theorem in normal logic programs, then introduce the notion of contrapositive programs. Finally, a theory of IE in nonmonotonic ILP is constructed.