Abstract
This paper describes an extension of Horn clause logic programs by bounded quantifiers. Bounded quantifiers had been extensively used in a part of mathematical logic called theory of admissible sets [2]. Later some variants of bounded quantifiers had been introduced in logic programming languages [12, 19, 21, 9, 6, 7]. We show that an extension of logic programs by bounded quantifiers has several equivalent logical semantics and is efficiently implementable using a variant of SLD-resolution, which we call SLDB-resolution. We give examples showing that introduction of bounded quantifiers results in a high level logical specification language. An expressive power of subsets of Horn clauses and subsets of logic programs with bounded quantifiers is compared. We also show that the use of bounded quantifiers sheds new light on classical negation in logic programming.
On leave from the International Laboratory of Intelligent Systems (SINTEL), 630090, Universitetski Prospect 4, Novosibirsk 90, Russia.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Apt and M.van Emden. Contributions to the theory of logic programming. Jornal of the Association for Computing Machinery, 29(3), 1982.
J.Barwise. Admissible Sets and Structures. Springer Verlag, 1975.
C.Beeri, Sh.Naqvi, R.Ramakrishnan, O.Shmueli, and Sh.Tsur. Sets and negation in a logic database language (LDL1). In Proc. 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 21–36. ACM Press, 1987.
H.-J.Bürkert. A resolution principle for clauses with constraints. In M.E.Stickel, editor, Proc. 10th CADE, volume 449 of Lecture Notes in Artificial Intelligence, pages 178–192, 1990.
C.C.Chang and H.J.Keisler. Model theory. North Holland, 1977.
A.Dovier, E.G.Omodeo, E.Pontelli, and G.Rossi. {log: A logic programming language with finite sets. In Proc. ICLP'91, pages 109–124. MIT Press, 1991.
P.van Hentenryck, V.Saraswat, and Y.Deville. Constraint processing in cc(fd). Technical report, Brown University, December 1991.
B.Jayaraman and D.A.Plaisted. Programming with equations, subsets and relations. In Proc. NACLP'89, Cleveland, 1989. MIT Press.
G.M.Kuper. Logic programming with sets. In Proc. 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 11–20. ACM Press, 1987.
G.M.Kuper. On the expressive power of logic programming languages with sets. In Proc. 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 10–14. ACM Press, 1988.
J.W.Lloyd. Foundations of Logic Programming. Springer Verlag, 1984.
S.S.Goncharov and D.I.Sviridenko. Σ -programming (in Russian), volume 120 of Vychislitelnye Systemy, pages 3–29. Novosibirsk, 1985.
S.S.Goncharov and D.I.Sviridenko. Theoretical aspects of σ-programming. In Mathematical Methods of Specification and Synthesis of Software Systems '85, volume 215 of Lecture Notes in Computer Science, pages 169–179, 1986.
S.S.Goncharov, Yu.L.Ershov, and D.I.Sviridenko. Semantic programming. In IFIP'86, pages 1093–1100. Elsevier Science, 1986.
M.Hagiya and T.Sakurai. Foundation of logic programming based on inductive definition. New Generation Computing, 2(1):59–77, 1984.
R.Kowalski. Logic programming. In Proc.IFIP'83, pages 133–145. Elsevier Science, 1983.
M.Alexander, P.Bilse, L.Jensen, and e.a. PDC Prolog User's Guide. Prolog Development Center, 1990.
T.Sato and H.Tamaki. Transformational logic program synthesis. In Proc. of the Conference on Fifth Generation Computer Systems, pages 195–201. ICOT, 1984.
J.T.Schwartz, R.B.K.Devar, E.Dubinski, and E.Schonberg. Programming with sets: an Introduction to SETL. Springer Verlag, 1986.
Sh.Tsur and C.Zaniolo. LDL: A logic-based language. In Proc. 12th International Conference on Very Large Databases, pages 33–40, Kyoto, Japan, 1986.
D.A.Turner. An overview of Miranda. ACM SIGPLAN Notices, 21(12):158–166, 1986.
A.Voronkov. Program execution methods in σ-programming (in Russian). In Proc. 4th Soviet Conf. on Applications of Mathematical Logic, pages 51–53, Tallinn, 1986.
A.Voronkov. Intuitionistic list theory (in Russian). In Proc. 8th Soviet Conf. on Mathematical Logic, page 32, Moscow, 1986.
A.Voronkov. Logic programs and their synthesis (in Russian). Technical Report 23, Institute of Mathematics, Novosibirsk, 1986.
A.Voronkov. Synthesis of logic programs (in Russian). Technical Report 24, Institute of Mathematics, Novosibirsk, 1986.
A.Voronkov. A natural calculus for Σ-programs (in Russian), volume 120 of Vychislitelnye Systemy, pages 14–23. Novosibirsk, 1987.
A.Voronkov. Logic programming and Σ-programming (in Russian). Kibernetika, (1):67–72, 1989.
A.Voronkov. N-realizability: one more constructive semantics. Technical Report 71, Monash University, Department of Computer Science, Clayton, Australia, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Voronkov, A. (1992). Logic programming with bounded quantifiers. In: Voronkov, A. (eds) Logic Programming. Lecture Notes in Computer Science, vol 592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55460-2_37
Download citation
DOI: https://doi.org/10.1007/3-540-55460-2_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55460-8
Online ISBN: 978-3-540-47083-0
eBook Packages: Springer Book Archive