An Implementation of Open Set Constraint Logic Language


The KIPS Transactions:PartA, Vol. 12, No. 5, pp. 385-390, Oct. 2005
10.3745/KIPSTA.2005.12.5.385,   PDF Download:

Abstract

Set constraints logic language is a language that adopts ´set theory´ in programming. In this paper, we introduce the procedure solving set constraints proposed by A. Dovier and show how the procedure can be implemented in logic language Prolog. The procedure is represented in ´rewriting rules´ and this representation is characterized by having nondeterministic rule applicationsand mathematical variables that is difficult to be implemented in general programming languages. In this paper, we show that the representation can easily implemented by using nondeterministic control, logical variables and data structure ´list´ provided in Prolog. Our implementation has following advantages.First we have implemented the full features of the language. Second we have described the implementation detail thisresearch. Third other used the commercial Prolog called SICStus, but we are using CIAO Prolog with GNU GPL(General Public License) and anyone can use it freely. Forth the software of our implementation is open source so anyone can use, modify, and distribute it freely.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
D. H. Shin and S. H. Son, "An Implementation of Open Set Constraint Logic Language," The KIPS Transactions:PartA, vol. 12, no. 5, pp. 385-390, 2005. DOI: 10.3745/KIPSTA.2005.12.5.385.

[ACM Style]
Dong Ha Shin and Sung Hoon Son. 2005. An Implementation of Open Set Constraint Logic Language. The KIPS Transactions:PartA, 12, 5, (2005), 385-390. DOI: 10.3745/KIPSTA.2005.12.5.385.