Some Properties of Inverse Resolution in Normal Logic Programs

Chiaki Sakama

Proceedings of the 9th International Workshop on Inductive Logic Programming (ILP'99), Lecture Notes in Artificial Intelligence 1634, Springer-Verlag, pages 279-290, 1999.

Abstract

This paper studies the properties of inverse resolution in normal logic programs. The V-operators are known as operations for inductive generalization in definite logic programs. In the presence of negation as failure in a program, however, the V-operators do not work as generalization operations in general and often make a consistent program inconsistent. Moreover, they may destroy the syntactic structure of logic programs such as acyclicity and local stratification. On the procedural side, unrestricted application of the V-operators may lose answers computed in the original program and make queries flounder. We provide sufficient conditions for the V-operators to avoid these problems.