de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Finite domain and cutting plane techniques in CLP($\cal PB$)

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44073

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44149

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Barth, P., & Bockmayr, A. (1995). Finite domain and cutting plane techniques in CLP($\cal PB$). In L. Sterling (Ed.), Proceedings of the Twelfth International Conference on Logic Programming (pp. 133-147). Cambridge, USA: MIT Press.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-ACFC-F
Zusammenfassung
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, ensuring local consistency is not enough 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 \clppb, 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.