56 search results - page 3 / 12 » Boolean Constraint Solving Using clp(FD) |
120
Voted
CP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
128
Voted
SAT
2004
Springer
15 years 8 months ago
2004
Springer
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...
139
Voted
JAR
2000
15 years 2 months ago
2000
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...
181
Voted
CPAIOR
2010
Springer
15 years 24 days ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
145
Voted
CORR
2010
Springer
15 years 5 days ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...