Skip to main content
SpringerLink
Log in

CS-Prolog: A generalized unification based constraint solver

  • Constraint Logic Programming
  • Conference paper
  • First Online:
Book cover Logic Programming '87 (LP 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 315))

Included in the following conference series:

Abstract

We have described the constraint logic programming language CS-Prolog. CS-Prolog is written in PROLOG about 1,500 lines. This is a very small as oppose to similar system CLP which is written in C about 12,000 lines, but less efficient than CLP. However, CS-Prolog solves equations and inequations in reasonable time and this paper shows the simple approach to constraint logic programming using PROLOG and this technique is very useful for constraint logic programming language system on top of PROLOG machine.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.Bundy, The Computer Modelling of Mathematical Reasoning, Academic Press, 1983.

    Google Scholar 

  2. T.Chikayama, ESP Reference Manual, ICOT TR-044, 1984.

    Google Scholar 

  3. A.Colmerauer, EQUATIONS AND INEQUATIONS ON FINITE AND INFINITE TREES, Proc. of FGCS '84, 1984.

    Google Scholar 

  4. M.Dincbas, CONSTRAINTS, LOGIC PROGRAMMING and DEDUCTIVE DATABASE, France-Japan AI and Computer Science Symposium '86, 1986.

    Google Scholar 

  5. N.Heintze et al, The CLP Programmer's Manual, Dept. of Computer Science, Monash Univ., 1986.

    Google Scholar 

  6. J.Jaffar and J. Lassez, A Logic Programming Language Schema, In D. DeGroot and G.Lindstrom, Eds., LOGIC PROGRAMMING: Functions, Relations, and Equations, Prentice Hall, 1986.

    Google Scholar 

  7. J.Jaffar and P.J.Stuckey, Logic Program Semantics for Programming with Equations, 3rd ICLP, Springer-Verlag, 1986.

    Google Scholar 

  8. K.Mukai, Unification over Complex Indeterminates in Prolog, Proc. of LPC '85, 1985.

    Google Scholar 

  9. H.Nakashima, Term Description:A Simple Powerful Extension to Prolog Data Structures, IJCAI '85, 1985.

    Google Scholar 

  10. H.Seki and K.Furukawa, Notes on Transformation Technics for Generate and Test Logic Programs, ICOT TM-0240, 1986.

    Google Scholar 

  11. Robert E. Shostak, On the SUP-INF Method for Proving Presburger Formulas, JACM '77, 1977.

    Google Scholar 

  12. R.Simmons COMMONSENCE ARITHMETIC REASONING, AAAI-86, 1986.

    Google Scholar 

  13. G.L.Steele Jr., The Definition and Implementation of A Computer Programming Language based on CONSTRAINTS, MIT Ph.D Dissertation, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Industrial Administration, Science Univ. of Tokyo, 278, Noda, Chiba, Japan

    Toshio Kawamura, Hayato Ohwada & Fumio Mizoguchi

Authors
  1. Toshio Kawamura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hayato Ohwada
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fumio Mizoguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Koichi Furukawa Hozumi Tanaka Tetsunosuke Fujisaki

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kawamura, T., Ohwada, H., Mizoguchi, F. (1988). CS-Prolog: A generalized unification based constraint solver. In: Furukawa, K., Tanaka, H., Fujisaki, T. (eds) Logic Programming '87. LP 1987. Lecture Notes in Computer Science, vol 315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19426-6_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-19426-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19426-2

  • Online ISBN: 978-3-540-39267-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation