非表示:
キーワード:
-
要旨:
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.
