Solving Pseudo-Boolean Constraints

Bockmayr, Alexander

doi:10.1007/3-540-59155-9_2

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

Solving Pseudo-Boolean Constraints

MPS-Authors

/persons/resource/persons44149

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

External Resource

https://rdcu.be/dxCRO
(出版社版)

Fulltext (restricted access)

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

フルテキスト (公開)

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

付随資料 (公開)

There is no public supplementary material available

引用

Bockmayr, A. (1994). Solving Pseudo-Boolean Constraints. In A., Podelski (Ed.), Constraint Programming: Basics and Trends (pp. 22-38). Berlin, Germany: Springer.

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

要旨

Pseudo-Boolean constraints are equations or inequalities between integer polynomials in 0-1 variables. On the one hand, they generalize Boolean constraints, on the other hand, they are a restricted form of finite domain constraints. In this paper, we present special constraint solving techniques for the domain {0,1} originating from mathematical programming. The key concepts are the generation of strong valid inequalities for the solution set of a constraint system and the notion of branch-and-cut.