Solving 0-1 Problems in CLP(PB)

Barth, Peter; Bockmayr, Alexander

doi:10.1109/CAIA.1993.366601

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Solving 0-1 Problems 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)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Barth, P., & Bockmayr, A. (1993). Solving 0-1 Problems in CLP(PB). In The Ninth Conference on Artificial Intelligence for Applications (pp. 263-269). Los Alamitos, USA: IEEE.

Cite as: https://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.