Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-I-92-233

CLP($\cal PB$): A Meta-Interpreter in CLP($\cal R$)

Barth, Peter

MPI-I-92-233. August 1992, 18 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
Constraint logic programming is one of the most attractive research areas in logic programming. Due to (J. Jaffar, 1987) the theoretical foundation of a general constraint logic programming language scheme CLP({{$\cal X$}}) is available. Unfortunately, implementing a CLP({{$\cal X$}}) system for some domain {$\cal X$} is a difficult task. The problematic points are providing a {\it constraint solver} and ensuring the {\it incrementality} of the constraint system. We propose here to use an existing CLP system as implementation environment for a new CLP language. We show that under certain conditions we can use the given constraint solver as constraint solver for the new CLP-language. We focus here on prototyping CLP({{$\cal PB$}}), where {$\cal PB$} denotes the structure of pseudo-Boolean functions, in CLP({{$\cal R$}}), where {$\cal R$} denotes the structures of real numbers.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-92-233.pdfMPI-I-92-233.pdfMPI-I-92-233.dvi80 KBytes; 144 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1992-233
Hide details for BibTeXBibTeX
@TECHREPORT{barth-92-mpii233,
  AUTHOR = {Barth, Peter},
  TITLE = {{CLP}({{$\cal PB$}}): {{A}} Meta-Interpreter in {CLP}({{$\cal R$}})},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-233},
  MONTH = {August},
  YEAR = {1992},
  ISSN = {0946-011X},
}