Short overview of the CLPS system
We propose an extension of Prolog to deal with set expressions using equality and membership operators and allowing restricted universal quantifiers in goals. Such extension allows a better expressive power, in particular when the language is used for a functional specification purpose. Those set expressions are treated as symbolic constraints and some mechanisms for constraints satisfaisability checking and solution values generating are provided. We describe, in the paper, the current implementation which is composed by three modules : preprocessor, satisfaction checker and solution values generator. Then, we demonstrate some promising results on the color problem comparing with standard Prolog and PROLOG III language.
In the future, we aim to extend our implementation to deal with the subset operator and the sequence data structure.
Key-WordsLogic Programming Prolog constraints CLPS set languages
Unable to display preview. Download preview PDF.