de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Solving 0-1 Problems in CLP($\cal PB$)

MPS-Authors
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;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Barth, P., & Bockmayr, A. (1993). Solving 0-1 Problems in CLP($\cal PB$). In Proceedings 9th Conference on Artificial Intelligence for Applications ({CAIA})} (pp. 263-269). Los Alamitos, USA: IEEE.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-ADE7-6
Abstract
0-1 problems arise in different areas, in particular in artificial intelligence and operations research. For many applications, a simple sub-procedure solving these problems is not sufficient. In this paper, we present the constraint logic programming language CLP(PB) which provides efficient 0-1 constraint solving within the logic programming paradigm. It is well suited for implementing various typical AI problems. CLP(PB) supports pseudo-Boolean constraints, that is equations and inequalities between integer polynomials in 0-1 variables, and pseudo-Boolean optimization, also known as 0-1 programming. We illustrate by example the advantage of pseudo-Boolean formulations versus equivalent ones in propositional logic. We also discuss constraint programming in CLP(PB) and the implementation of algorithms interacting with the current constraint set.