Advertisement

Constraint logic programming in the sequent calculus

  • John Darlington
  • Yike Guo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 822)

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.

Keywords

Logic Programming Constraint System Atomic Formula Intuitionistic Logic Horn Clause 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Cla78]
    Keith Clark. Negation as failure. In Logic and Data Bases, pages 293–322. Plenum Press, 1978.Google Scholar
  2. [Col82]
    A. Colmerauer. Prolog and infinite trees. In K.L. Clark and S.A. Tarnlund, editors, Logic Programming. Academic Press, New Yok, 1982.Google Scholar
  3. [Col87]
    A. Colmerauer. Opening the Prolog III universe. Byte, July, 1987.Google Scholar
  4. [Gal86]
    Jean H. Gallier. Logic for Computer Science. John Wiley & Sons, 1986.Google Scholar
  5. [Guo93]
    Yike Guo. Definitional Constraint Programming. PhD thesis, Dept. of Computing, Imperial College, 1993. Forthcoming.Google Scholar
  6. [J.C91]
    J.Cirulis. An algebraization of first order logic with terms. In Colloquia Mathematica Sociatatis Janos Boolyai, 54. 1991.Google Scholar
  7. [JL87]
    Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Prod. of POPL 87, pages 111–119, 1987.Google Scholar
  8. [Kle67]
    S. Kleene. Mathematical Logic. New York: Wiley Interscience, 1967.Google Scholar
  9. [KS89]
    Akira Aiba Ko Sakai. CAL: A Theoretical Background of Constraint Logic Programming and its Applications. Journal of Symbolic Computation, Aug. 1989.Google Scholar
  10. [Mes89]
    Jose Meseguer. General logics. Technical Report SRI-CSL-89-5, SRI International, March 1989.Google Scholar
  11. [MG91]
    Giorgio Levi Maurizio Gabbrielli. Modeling answer constraints in constraint logic programs. In Prof. Eighth International Conference on Logic Programming. The MIT Press, 1991.Google Scholar
  12. [MHS88]
    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.Google Scholar
  13. [NM+89]
    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.Google Scholar
  14. [SL92]
    V.A. Saraswat and Patrick Lincoln. Linear concurrent constraint programming. Technical report, Xerox PARC, Feb 1992. Unpublished Draft.Google Scholar
  15. [Smo89]
    Gert Smolka. Logic Programming over Polymorphically Order-Sorted Types. PhD thesis, Vom Fachbereich Informatik der Universitat Kaiserlautern, May 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • John Darlington
    • 1
  • Yike Guo
    • 1
  1. 1.Dept. of ComputingImperial CollegeLondon

Personalised recommendations