660 search results - page 5 / 132 » Hybrid CSP Solving |
AAAI
1998
15 years 6 months ago
1998
150
click to vote
CSCLP
2005
Springer
15 years 11 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
128
click to vote
SAT
2007
Springer
15 years 11 months ago
2007
Springer
We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and p...