Abstract
We prove that negative hyper-resolution is a sound and complete procedure for answering queries in disjunctive logic programs. In our formulation, answers of queries are defined using disjunctive substitutions, which are more flexible than answer literals used in theorem proving systems.
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
Apt, K.R., van Emden, M.H.: Contributions to the theory of logic programming. Journal of the ACM 29(3), 841–862 (1982)
Baumgartner, P., Furbach, U.: Calculi for disjunctive logic programming. In: Maluszynski, J. (ed.) Proc. of ILPS 1997, pp. 229–243. The MIT Press, Cambridge (1997)
Brass, S., Lipeck, U.W.: Generalized bottom-up query evaluation. In: Pirotte, A., Delobel, C., Gottlob, G. (eds.) EDBT 1992. LNCS, vol. 580, pp. 88–103. Springer, Heidelberg (1992)
Chang, C.-L., Lee, R.C.-T.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1973)
Green, C.C.: Theorem proving by resolution as basis for question-answering systems. Machine Intelligence 4, 183–205 (1969)
Kowalski, R.A.: Predicate logic as a programming language. Information Processing Letters 74, 569–574 (1974)
Kunen, K.: The semantics of answer literals. Journal of Automated Reasoning 17(1), 83–95 (1996)
Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. MIT Press, Cambridge (1992)
Lobo, J., Rajasekar, A., Minker, J.: Semantics of Horn and disjunctive logic programs. Theoretical Computer Science 86(1), 93–106 (1991)
Loveland, D.: Near-Horn Prolog. In: Lassez, J.-L. (ed.) Proc. of the 4th Int. Conf. on Logic Programming, pp. 456–469. The MIT Press, Cambridge (1987)
Luckham, D., Nilsson, N.J.: Extracting information from resolution proof trees. Artificial Intelligence 2, 27–54 (1971)
Robinson, J.A.: Automatic deduction with hyper-resolution. International Journal of Computer Mathematics 1, 227–234 (1965)
Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM 12(1), 23–41 (1965)
van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. Journal of the ACM 23(4), 733–742 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, L.A. (2004). Negative Hyper-resolution as Procedural Semantics of Disjunctive Logic Programs. In: Alferes, J.J., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2004. Lecture Notes in Computer Science(), vol 3229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30227-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-30227-8_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23242-1
Online ISBN: 978-3-540-30227-8
eBook Packages: Springer Book Archive