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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming (J. Minker ed.), Morgan Kaufmann, pp. 89–148, 1988.
K. R. Apt and M. Bezem. Acyclic programs. New Generation Computing 9:335–363, 1991.
M. Bain and S. Muggleton. Non-monotonic learning. In: [14], pp. 145–161.
M. Bain. Experiments in non-monotonic first-order induction. In: [14], pp. 423–436.
R. B. Banerji. Learning theoretical terms. In: [14], pp. 93–112.
C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming 19/20:73–148, 1994.
K. L. Clark. Negation as failure. In: H. Gallaire and J. Minker (eds.), Logic and Data Bases, Plenum Press, pp. 119–140, 1978.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In: Proc. 5th Int’l Conf. and Symp. on Logic Programming, MIT Press, pp. 1070–1080, 1988.
J. W. Lloyd. Foundations of logic programming (2nd edition), Springer-Verlag, 1987.
S. Muggleton. Duce, an oracle based approach to constructive induction. In: Proc. IJCAI-87, Morgan Kaufmann, pp. 287–292, 1987.
S. Muggleton. Inverting the resolution principle. In: Machine Intelligence, vol. 12, Oxford University Press, pp. 93–103, 1991.
S. Muggleton. Inductive Logic Programming. In [14], pp. 3–27, 1992.
S. Muggleton and W. Buntine. Machine invention of first-order predicate by inverting resolution. In: [14>], pp. 261–280.
S. Muggleton (ed.). Inductive Logic Programming, Academic Press, 1992.
T. C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, pp. 193–216, 1988.
C. Rouveirol. Extension of inversion of resolution applied to theory completion. In: [14], pp. 63–92.
K. Taylor. Inverse resolution of normal clauses. In: Proc. ILP-93, J. Stefan Institute, pp. 165–177, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakama, C. (1999). Some Properties of Inverse Resolution in Normal Logic Programs. In: Džeroski, S., Flach, P. (eds) Inductive Logic Programming. ILP 1999. Lecture Notes in Computer Science(), vol 1634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48751-4_26
Download citation
DOI: https://doi.org/10.1007/3-540-48751-4_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66109-2
Online ISBN: 978-3-540-48751-7
eBook Packages: Springer Book Archive