Sciweavers

Share
805 search results - page 1 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
STACS
2007
Springer
11 years 11 months ago
Enumerating All Solutions for Constraint Satisfaction Problems
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
Henning Schnoor, Ilka Schnoor
STACS
2009
Springer
12 years 7 days ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...
CIE
2007
Springer
11 years 11 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
CP
2005
Springer
11 years 11 months ago
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
Chris Houghton, David A. Cohen
CPAIOR
2009
Springer
12 years 1 days ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
books