Local Consistency and SAT-Solvers

01/18/2014
by   Peter Jeavons, et al.
0

Local consistency techniques such as k-consistency are a key component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency techniques on a constraint satisfaction problem is precisely captured by using a particular inference rule, which we call negative-hyper-resolution, on the standard direct encoding of the problem into Boolean clauses. We also show that current clause-learning SAT-solvers will discover in expected polynomial time any inconsistency that can be deduced from a given set of clauses using negative-hyper-resolvents of a fixed size. We combine these two results to show that, without being explicitly designed to do so, current clause-learning SAT-solvers efficiently simulate k-consistency techniques, for all fixed values of k. We then give some experimental results to show that this feature allows clause-learning SAT-solvers to efficiently solve certain families of constraint problems which are challenging for conventional constraint-programming solvers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/27/2014

Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem

On the one hand, Constraint Satisfaction Problems allow one to declarati...
research
03/05/2019

PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers

There have been recent efforts for incorporating Graph Neural Network mo...
research
09/17/2021

Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat

Many constraint satisfaction problems involve synthesizing subgraphs tha...
research
12/08/2022

Quantum-Inspired Approximations to Constraint Satisfaction Problems

Two contrasting algorithmic paradigms for constraint satisfaction proble...
research
05/25/2019

Image Detection and Digit Recognition to solve Sudoku as a Constraint Satisfaction Problem

Sudoku is a puzzle well-known to the scientific community with simple ru...
research
01/15/2014

Bounds Arc Consistency for Weighted CSPs

The Weighted Constraint Satisfaction Problem (WCSP) framework allows rep...
research
04/20/2017

On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns

Singleton arc consistency is an important type of local consistency whic...

Please sign up or login with your details

Forgot password? Click here to reset