Sciweavers

711 search results - page 3 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
IJCAI
1993
13 years 6 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
CSL
2008
Springer
13 years 7 months ago
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
Nadia Creignou, Henning Schnoor, Ilka Schnoor
CACM
2010
94views more  CACM 2010»
13 years 5 months ago
Constraint satisfaction problems and global cardinality constraints
Andrei A. Bulatov, Dániel Marx
LICS
2010
IEEE
13 years 3 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin