DeepAI AI Chat
Log In Sign Up

Unsatisfiable Cores for Constraint Programming

05/08/2013
by   Nicholas Downing, et al.
The University of Melbourne
0

Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cost. This approach is somewhat naive, especially for soft-constraint optimization problems in which the soft constraints are mostly satisfied. Unsatisfiable-core approaches to solving soft constraint problems in Boolean Satisfiability (e.g. MAXSAT) force all soft constraints to hold initially. When solving fails they return an unsatisfiable core, as a set of soft constraints that cannot hold simultaneously. Using this information the problem is relaxed to allow certain soft constraint(s) to be violated and solving continues. Since Lazy Clause Generation (LCG) solvers can also return unsatisfiable cores we can adapt the MAXSAT unsatisfiable core approach to CP. We implement the original MAXSAT unsatisfiable core solving algorithms WPM1, MSU3 in a state-of-the-art LCG solver and show that there exist problems which benefit from this hybrid approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/25/2015

Unsatisfiable Cores and Lower Bounding for Constraint Programming

Constraint Programming (CP) solvers typically tackle optimization proble...
02/13/2015

A Multicore Tool for Constraint Solving

*** To appear in IJCAI 2015 proceedings *** In Constraint Programming (C...
09/01/2020

XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems

In this document, we introduce XCSP3-core, a subset of XCSP3 that allows...
03/12/2019

NeuroCore: Guiding CDCL with Unsat-Core Predictions

The NeuroSAT neural network architecture was recently introduced for pre...
04/13/2022

Agent-based Constraint Solving for Resource Allocation in Manycore Systems

For efficiency reasons, manycore systems are increasingly heterogeneous,...
07/03/2018

Stochastic Constraint Optimization using Propagation on Ordered Binary Decision Diagrams

A number of problems in relational Artificial Intelligence can be viewed...