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


Cutting planes in constraint logic programming

Bockmayr, Alexander

MPI-I-94-207. February 1994, 23 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
In this paper, we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP($\cal PB$) for logic programming with pseudo-Boolean constraints. Our approach is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case of 0-1 constraints, this can improve or replace the finite domain techniques used in existing constraint logic programming systems.
Categories / Keywords: logic programming
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-94-207.pdfMPI-I-94-207.pdfMPI-I-94-207.dvi - MPI-I-94-207.dvi
152 KBytes; 148 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:
Hide details for BibTeXBibTeX
  AUTHOR = {Bockmayr, Alexander},
  TITLE = {Cutting planes in constraint logic programming },
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-94-207},
  MONTH = {February},
  YEAR = {1994},
  ISSN = {0946-011X},