MPI-INF/SWS Research Reports 1991-2021
1. Author,Editor - 3. with BibTeX cite keys
MPI-I-94-207
Cutting planes in constraint logic programming
Bockmayr, Alexander
February 1994, 23 pages.
.Status: available - back from printing
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
-
MPI-I-94-207.pdf
- MPI-I-94-207.dvi
- Attachement: MPI-I-94-207.dvi (152 KBytes); MPI-I-94-207.pdf (148 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1994-207
BibTeX@TECHREPORT{Bockmayr-94-mpii207,
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},
}