Local consistency and SAT−solvers
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hyper-resolution, on the direct Boolean encoding of the CSP instance. We also show that current clause-learning SAT-solver...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Springer
2010
|
Search Result 1
Search Result 2
Search Result 3
Search Result 4
