Fast Set Bounds Propagation Using a BDD-SAT Hybrid

01/16/2014
by   Graeme Gange, et al.
0

Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques in- cur the significant overhead of constructing and manipulating graphs during search. We present a set-constraint solver which combines BDD-based set-bounds propagators with the learning abilities of a modern SAT solver. Together with a number of improvements beyond the basic algorithm, this solver is highly competitive with existing propagation based set constraint solvers.

READ FULL TEXT
research
09/09/2011

Solving Set Constraint Satisfaction Problems using ROBDDs

In this paper we present a new approach to modeling finite set domain co...
research
03/02/2011

Decentralized Constraint Satisfaction

We show that several important resource allocation problems in wireless ...
research
07/02/2019

Core First Unit Propagation

Unit propagation (which is called also Boolean Constraint Propagation) h...
research
07/29/2009

Online Search Cost Estimation for SAT Solvers

We present two different methods for estimating the cost of solving SAT ...
research
05/08/2015

Short Portfolio Training for CSP Solving

Many different approaches for solving Constraint Satisfaction Problems (...
research
08/16/2019

The Regularization of Small Sub-Constraint Satisfaction Problems

This paper describes a new approach on optimization of constraint satisf...
research
08/01/2013

An Enhanced Features Extractor for a Portfolio of Constraint Solvers

Recent research has shown that a single arbitrarily efficient solver can...

Please sign up or login with your details

Forgot password? Click here to reset