MPI-INF/SWS Research Reports 1991-2017

2. Number - only D2


Analysis of nonlinear constraints in CLP(R)

Hanus, Michael

November 1992, 31 pages.

Status: available - back from printing

Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic programming languages like CLP(R) or Prolog III solve only linear constraints and delay nonlinear constraints until they become linear. This efficient implementation method has the disadvantage that sometimes computed answers are unsatisfiable or infinite loops occur due to the unsatisfiability of delayed nonlinear constraints. These problems could be solved by using a more powerful constraint solver which can deal with nonlinear constraints like in RISC-CLP(Real). Since such powerful constraint solvers are not very efficient, we propose a compromise between these two extremes. We characterize a class of CLP(R) programs for which all delayed nonlinear constraints become linear at run time. Programs belonging to this class can be safely executed with the efficient CLP(R) method while the remaining programs need a more powerful constraint solver.

  • MPI-I-92-251.pdfMPI-I-92-251.pdfMPI-I-92-251.dvi
  • Attachement: MPI-I-92-251.dvi (149 KBytes); MPI-I-92-251.pdf (203 KBytes)

URL to this document:

Hide details for BibTeXBibTeX
  AUTHOR = {Hanus, Michael},
  TITLE = {Analysis of nonlinear constraints in CLP(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-251},
  MONTH = {November},
  YEAR = {1992},
  ISSN = {0946-011X},