Logic-Based 0-1 Constraint Programming

A logic view of 0-1 integer programming problems, providing new insights into the structure of problems that can lead the researcher to more effective solution techniques depending on the problem class. Operations research techniques are integrated into a logic programming environment. The first monographic treatment that begins to unify these two methodological approaches.
Logic-based methods for modelling and solving combinatorial problems have recently started to play a significant role in both theory and practice. The application of logic to combinatorial problems has a dual aspect. On one hand, constraint logic programming allows one to declaratively model combinatorial problems over an appropriate constraint domain, the problems then being solved by a corresponding constraint solver. Besides being a high-level declarative interface to the constraint solver, the logic programming language allows one also to implement those subproblems that cannot be naturally expressed with constraints. On the other hand, logic-based methods can be used as a constraint solving technique within a constraint solver for combinatorial problems modelled as 0-1 integer programs.

Booknews

Addressed to two distinct audiences. For developers and users of constraint logic programming systems, discusses the requirements of integrating techniques for combinatorial optimization, identifies problems that are expected to arise, and presents solution to a logic-based approach. For researchers in operations, introduces logic-based techniques for solving 1-0 problems that in some cases turn out to be superior to the classical polyhedral view underlying systems based on linear programming. Revised from a 1995 PhD dissertation for the University of Saarbrucken. Annotation c. Book News, Inc., Portland, OR (booknews.com)