Advertisement

Short overview of the CLPS system

  • Bruno Legeard
  • Emmanuel Legros
System Demonstrations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 528)

Abstract

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-Words

Logic Programming Prolog constraints CLPS set languages 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Bruno Legeard
    • 1
  • Emmanuel Legros
    • 1
  1. 1.ENSMM Besançon — LABBesancon

Personalised recommendations