CS-Prolog: A generalized unification based constraint solver

Toshio Kawamura, Hayato Ohwada, Fumio Mizoguchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLogic Programming 1987 - Proceedings of the 6th Conference
EditorsHozumi Tanaka, Koichi Furukawa, Tetsunosuke Fujisaki
PublisherSpringer Verlag
Pages19-39
Number of pages21
ISBN (Print)9783540194262
DOIs
Publication statusPublished - 1 Jan 1988
Event6th Conference on Logic Programming, 1987 - Tokyo, Japan
Duration: 22 Jun 198724 Jun 1987

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume315 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th Conference on Logic Programming, 1987
CountryJapan
CityTokyo
Period22/06/8724/06/87

    Fingerprint

Cite this

Kawamura, T., Ohwada, H., & Mizoguchi, F. (1988). CS-Prolog: A generalized unification based constraint solver. In H. Tanaka, K. Furukawa, & T. Fujisaki (Eds.), Logic Programming 1987 - Proceedings of the 6th Conference (pp. 19-39). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 315 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-19426-6_2