130 search results - page 1 / 26 » Binary Representations for General CSPs |
FLAIRS
2001
13 years 6 months ago
2001
ECAI
1992
Springer
13 years 8 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
CP
2001
Springer
13 years 9 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
AAAI
2007
13 years 7 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
KR
2010
Springer
13 years 9 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...