Cutting Planes in Constraint Logic Programming
نویسنده
چکیده
In this paper, we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our approach is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case of 0-1 constraints, this can improve or replace the nite domain techniques used in existing constraint logic programming systems.
منابع مشابه
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...
متن کاملLogic-Based Methods for Optimization
This tutorial describes a logic based approach to formulating and solving pure and mixed integer programming problems It develops logical counterparts for ideas associated with traditional branch and cut methods such as cutting planes facet de ning cuts re laxations etc The motivations for doing this are a to exploit the structure of a wide range of problems that are too complex for polyhedral ...
متن کاملSAT4JPseudo: replacing resolution by cutting planes
SAT4J [1] is an open-source library of conflict-driven clause learning SAT solvers in the spirit of GRASP, zChaff and MiniSAT in Java. Its extension to pseudoboolean optimization is done by replacing the resolution performed between clauses by cutting planes, in the spirit of PBChaff [5] or Galena [4]. Compared to the version submitted to the PB05 evaluation, the solver is representing each kin...
متن کاملFaster Training of Structural SVMs with Diverse M-Best Cutting-Planes
Training of Structural SVMs involves solving a large Quadratic Program (QP). One popular method for solving this optimization problem is a cutting-plane approach, where the most violated constraint is iteratively added to a working-set of constraints. Unfortunately, training models with a large number of parameters remains a time consuming process. This paper shows that significant computationa...
متن کاملOn Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algorithms derived from the Davis-Logemann-Loveland (DLL) procedure for Propositional Satisfiability (SAT). This paper proposes the utilization of cutting planes in a DLL-style PBO algorithm, which incorporates the most e...
متن کامل