English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

Finite domain and cutting plane techniques in CLP (PB)

MPS-Authors
/persons/resource/persons44073

Barth,  Peter
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44149

Bockmayr,  Alexander
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPI-I-94-261.pdf
(Any fulltext), 126KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Barth, P., & Bockmayr, A.(1994). Finite domain and cutting plane techniques in CLP (PB) (MPI-I-94-261). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B5FB-8
Abstract
Finite domain constraints are one of the most important constraint domains in constraint logic programming. Usually, they are solved by local consistency techniques combined with enumeration. We argue that, in many cases, the concept of local consistency is too weak for both theoretical and practical reasons. We show how to obtain more information from a given constraint set by computing cutting planes and how to use this information in constraint solving and constrained optimization. Focusing on the pseudo-Boolean case CLP(PB), where all domains are equal to the two-element set $\{0,1\}$, we present specialized cutting plane techniques and illustrate them on a number of examples.