57 search results - page 1 / 12 » Non-uniform Boolean Constraint Satisfaction Problems with Ca... |
CSL
2008
Springer
13 years 6 months ago
2008
Springer
CACM
2010
13 years 4 months ago
2010
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
SAT
2004
Springer
13 years 9 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...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...