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

Barth, Peter; Bockmayr, Alexander

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Modelling 0-1 Problems in CLP($\cal 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

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-ABEE-6

要旨

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.