13827 search results - page 2508 / 2766 » The state of artificial intelligence |
210
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
153
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we argue that an attractive and potentially very general way of achieving generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a C...
166
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed down over the past few years. On the other hand, w...
198
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
184
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...