Abstract
In this paper, we are developing a new logical semantics of CLP. It is shown that CLP is based on an amalgamated logic embedding the entailment relation of constraints into a fragment of intuitionistic logic. Constrained SLD resolution corresponds to a complete proof search in the amalgamated logic. The framework provides not only the logical account on the definitional semantics towards CLP but also a general way to integrate constraints into various logic programming systems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Keith Clark. Negation as failure. In Logic and Data Bases, pages 293–322. Plenum Press, 1978.
A. Colmerauer. Prolog and infinite trees. In K.L. Clark and S.A. Tarnlund, editors, Logic Programming. Academic Press, New Yok, 1982.
A. Colmerauer. Opening the Prolog III universe. Byte, July, 1987.
Jean H. Gallier. Logic for Computer Science. John Wiley & Sons, 1986.
Yike Guo. Definitional Constraint Programming. PhD thesis, Dept. of Computing, Imperial College, 1993. Forthcoming.
J.Cirulis. An algebraization of first order logic with terms. In Colloquia Mathematica Sociatatis Janos Boolyai, 54. 1991.
Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Prod. of POPL 87, pages 111–119, 1987.
S. Kleene. Mathematical Logic. New York: Wiley Interscience, 1967.
Akira Aiba Ko Sakai. CAL: A Theoretical Background of Constraint Logic Programming and its Applications. Journal of Symbolic Computation, Aug. 1989.
Jose Meseguer. General logics. Technical Report SRI-CSL-89-5, SRI International, March 1989.
Giorgio Levi Maurizio Gabbrielli. Modeling answer constraints in constraint logic programs. In Prof. Eighth International Conference on Logic Programming. The MIT Press, 1991.
M.Dincbas, P.Van Hentenryck, and H. Simonis. The Constraint Logic Programming Language CHIP. In Procedings of the Internatioal Conference on Fifth Generation Computer System, Tokyo, Japan, Nov. 1988.
Gopalan Nadathur, Dale Miller, et al. Uniform proofs as a foundation for logic programming. Technical report, Computer and Information Science Department, Univ. of Pennsylvania, 1989.
V.A. Saraswat and Patrick Lincoln. Linear concurrent constraint programming. Technical report, Xerox PARC, Feb 1992. Unpublished Draft.
Gert Smolka. Logic Programming over Polymorphically Order-Sorted Types. PhD thesis, Vom Fachbereich Informatik der Universitat Kaiserlautern, May 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Darlington, J., Guo, Y. (1994). Constraint logic programming in the sequent calculus. In: Pfenning, F. (eds) Logic Programming and Automated Reasoning. LPAR 1994. Lecture Notes in Computer Science, vol 822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58216-9_39
Download citation
DOI: https://doi.org/10.1007/3-540-58216-9_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58216-8
Online ISBN: 978-3-540-48573-5
eBook Packages: Springer Book Archive