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

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Modelling 0-1 Problems 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. (1996). Modelling 0-1 Problems in CLP($\cal PB$). In Proceedings of the Second International Conference on Practical Application of Constraint Technology (pp. 1-9). London, UK: The Practical Application Company.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-ABEE-6
Zusammenfassung
Many practical problems involve constraints in 0-1 variables. We apply the constraint logic programming language CLP(PB) to model and reason about 0-1 problems. Given a set of possibly non-linear 0-1 constraints, the solver of CLP(PB) computes an equivalent set of extended clauses. By exploiting the metaprogramming facilities of the logic programming environment, we are able to deal with arbitrary logical conditions between the constraints, in particular with disjunction and implication. At the end, the simplified constraint set is given to an underlying 0-1 constraint solver, which can be either a constraint programming or a mathematical programming system.