Sciweavers

942 search results - page 15 / 189
» Cooperating Constraint Solvers
Sort
View
DATE
2005
IEEE
150views Hardware» more  DATE 2005»
14 years 29 days ago
Pueblo: A Modern Pseudo-Boolean SAT Solver
This paper introduces a new SAT solver that integrates logicbased reasoning and integer programming methods to systems of CNF and PB constraints. Its novel features include an eff...
Hossein M. Sheini, Karem A. Sakallah
SPLC
2008
13 years 8 months ago
Do SAT Solvers Make Good Configurators?
A configuration process is about finding a configuration, a setting, that satisfies the requirements given by the user and constraints imposed by the domain. Feature models are us...
Mikolás Janota
JAIR
2010
145views more  JAIR 2010»
13 years 5 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
IJCAI
2001
13 years 8 months ago
Refining the Basic Constraint Propagation Algorithm
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
Christian Bessière, Jean-Charles Rég...
SAT
2004
Springer
115views Hardware» more  SAT 2004»
14 years 20 days ago
Full CNF Encoding: The Counting Constraints Case
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
Olivier Bailleux, Yacine Boufkhad