Modelling 0-1 Problems in CLP(PB)
نویسندگان
چکیده
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 simpli ed constraint set is given to an underlying 0-1 constraint solver, which can be either a constraint programming or a mathematical programming system.
منابع مشابه
Max-planck-institut F Ur Informatik Linear 0 -1 Inequalities and Extended Clauses K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Author's Address
Extended clauses are the basic formulas of the 0-1 constraint solver for the constraint logic programming language CLP(PB). We present a method for transforming an arbitrary linear 0-1 inequality into a set of extended clauses, such that the solution space remains invariant. After applying well-known linearization techniques on non-linear 0-1 constraints followed by the presented transformation...
متن کاملLinear 0-1 Inequalities and Extended Clauses
Extended clauses are the basic formulas of the 0-1 constraint solver for the constraint logic programming language CLP(PB). We present a method for transforming an arbitrary linear 0-1 inequality into a set of extended clauses, such that the solution space remains invariant. After applying well-known linearization techniques on non-linear 0-1 constraints followed by the presented transformation...
متن کاملFinite Domain and Cutting Plane Techniques in CLP(PB)
Finite domain constraints are one of the most important constraint domains in constraint logic programming. Usually, they are solved by local consistency techniques combined with enumeration. We argue that, in many cases, the concept of local consistency is too weak for both theoretical and practical reasons. We show how to obtain more information from a given constraint set by computing cuttin...
متن کاملModelling Modal Satisfiability in Constraint Logic Programming
We present a novel encoding of modal satisfiability problems as Constraint Satisfaction Problems. We allow the domains of the resulting constraints to contain other values than just the Boolean 0 or 1, and add various constraints to reason about these values. This modelling is pivotal to speeding up the performance of our constraint-based procedure for modal satisfiability in Constraint Logic P...
متن کاملSCLP Semantics for (multi-criteria) Shortest Path Problems
The aim of the paper is to show an example of interaction between the AI and OR elds of research using the Constraint Programming (CP) framework to glue them together. We solve a shortest path problem using the c-semiring-based framework for programming over soft constraints (SCLP), which is an extension of classical constraint solving and programming. The SCLP approac handle uniformly several ...
متن کامل