Abstract
There is a growing interest in ways to represent incomplete information in logic programs. It has been shown that limited forms abduction can be used quite elegantly for this purpose. In this paper, we propose a a three-valued completion semantics for abductive logic programs, which solves some problems associated with Console et al's two-valued completion semantics. The semantics is a generalization of Kunen's completion semantics for general logic programs, which is know to correspond very well to a class of effective proof procedures for general logic programs. Secondly, we propose a proof procedure for abductive logic programs, which is a generalization of a proof procedure for general logic programs based on constructive negation. This proof procedure is sound and complete with respect to the proposed semantics. Basically, by generalizing a number of results on general logic programs to the class of abductive logic programs, we present further evidence for the idea that limited forms of abduction can be added quite naturally to general logic programs. One problem that remains, is the occurrence of inconsistencies. We argue that there are cases in which these do not pose a problem.
Preview
Unable to display preview. Download preview PDF.
References
Krzysztof R. Apt and Marc Bezem. Acyclic programs. New Generation Computing, 9:335–363, 1991.
Luca Console, Daniele Theseider Dupre, and Pietro Torasso. On the relationship between abduction and deduction. Journal of Logic and Computation, 1(5):661–690, 1991.
David Chan. Constructive negation based on the completed database. In Proceedings of the International Conference on Logic Programming, pages 111–125. MIT Press, 1988.
K. L. Clark. Negation as failure rule. In H. Gallaire and G. Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, 1978.
Marc Denecker and Danny De Schreye. SLDNFA: an abductive procedure for normal abductive programs. In Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 686–700, 1992.
Marc Denecker and Danny De Schreye. Representing incomplete knowledge in abductive logic programming. In Proceedings of the International Logic Programming Symposium, 1993.
Kees Doets. From Logic to Logic Programming. The MIT Press series in Foundations of Computing. MIT Press, 1993. forthcomming.
Wlodzimierz Drabent. SLS-resolution without floundering. In Proceedings of the workshop on Logic Programming and Non-Monotonic Reasoning, 1993.
Wlodzimierz Drabent. What is failure? an approach to constructive negation. Updated version of a Technical Report LITH-IDA-R-91-23 at Linkoping University, 1993.
Melvin Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2(4):295–312, 1985.
Michael Gelfond and Vladimir Lifschitz. Logic programs with classical negation. In Proceedings of the International Conference on Logic Programming, pages 579–597, 1990.
Michael Gelfond and Vladimir Lifschitz. Representing actions in extended logic programming. In Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 559–573, 1992.
A.C. Kakas, R.A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2:719–770, 1992.
Kenneth Kunen. Negation in logic programming. Journal of Logic Programming, 4:289–308, 1987.
J.W. Lloyd. Foundations of Logic Programming. Symbolic Computation — Artificial Intelligence. Springer-Verlag, 1987. Second, extended edition.
John C. Shepherdson. Language and equality theory in logic programming. Technical Report PM-88-08, School of Mathematics, University Walk, Bristol, BS8 1 TW, England, 1988.
Peter J. Stuckey. Constructive negation for constraint logic programming. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 328–339. IEEE Computer Society Press, July 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag
About this paper
Cite this paper
Teusink, F. (1994). Three-valued completion for abductive logic programs. In: Levi, G., RodrÃguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1994. Lecture Notes in Computer Science, vol 850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58431-5_12
Download citation
DOI: https://doi.org/10.1007/3-540-58431-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58431-5
Online ISBN: 978-3-540-48791-3
eBook Packages: Springer Book Archive