Abstract
We present a correct goal-directed procedure for consistent logic program with integrity constraints in stable model semantics [5]. Although there are correct bottom-up procedures for every general logic program [13, 4, 15, 7] to compute stable models, there are no proposed correct goal-directed procedure for every general logic program. Our proposed procedure is correct not only for successful derivation but also for finite failure. This procedure is an extension of Eshghi's procedure [3] which is correct for every call-consistent logic program, and can be regarded as a combination of the model elimination procedure [10] and consistency checking in updates of implicit deletions [14].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Dung, P. M., Negations as Hypotheses: An Abductive Foundation for Logic Programming, Proc. of ICLP'91, pp. 3–18 (1991).
Elkan, C., A Rational Reconstruction of Nonmonotonic Truth Maintenance Systems, Artificial Intelligence, 43, pp. 219–234 (1990).
Eshghi, K., Kowalski, R. A., Abduction Compared with Negation by Failure, Proc. of ICLP'89, pp. 234–254 (1989).
Fages, F., A New Fixpoint Semantics for General Logic Programs Compared with the Well-Founded and the Stable Model Semantics, Proc. of ICLP'90, pp. 442–458 (1990).
Gelfond, M., Lifschitz, V., The Stable Model Semantics for Logic Programming. Proc. of LP'88, pp. 1070–1080 (1988).
Gelfond, M., Lifschitz, V., Logic Programs with Classical Negation, Proc. of ICLP'90, pp. 579–597 (1990).
Inoue, K., Koshimura, M., Hasegawa, R., Embedding Negation as Failure into a Model Generation Theorem Prover, Proc. of CADE-11, LNA1607, pp. 400–415 (1992).
Kakas, A. C, Mancarella, P., Generalized Stable Models: A Semantics for Abduction, Proc. of ECAI'90, pp. 385–391 (1990).
Kakas, A. C., Mancarella, P., Stable Theories for Logic Programs, Proc. of ILPS'91, pp. 85–100 (1991).
Loveland, D. W., Automated Theorem Proving: A Logical Basis, North-Holland (1978).
Poole, D., Compiling a Default Reasoning System into Prolog, New Generation Computing, Vol. 9, No. 1, pp. 3–38 (1991).
Reiter, R., A Logic for Default Reasoning, Artificial Intelligence, 13, pp. 81–132 (1980).
Saccà , D., Zaniolo, C., Stable Models and Non-Determinism in Logic Programs with Negation, Proc. of PODS'90, pp. 205–217 (1990).
Sadri, F., Kowalski, R., A Theorem-Proving Approach to Database Integrity, Foundations of Deductive Database and Logic Programming, (J. Minker. Ed.). Morgan Kaufmann Publishers, pp. 313–362 (1988).
Satoh, K., Iwayama, N., Computing Abduction Using the TMS. Proc. of ICLP'91, pp. 505–518 (1991).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Satoh, K., Iwayama, N. (1993). A Correct goal-directed proof procedure for a general logic program with integrity constraints. In: Lamma, E., Mello, P. (eds) Extensions of Logic Programming. ELP 1992. Lecture Notes in Computer Science, vol 660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56454-3_2
Download citation
DOI: https://doi.org/10.1007/3-540-56454-3_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56454-6
Online ISBN: 978-3-540-47562-0
eBook Packages: Springer Book Archive