Local consistency and SAT−solvers
Local consistency techniques such as k-consistency are a key component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency techniques on a constraint satisfaction problem is precisely captured by using a particular inference rule,...
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Journal article |
| Julkaistu: |
2012
|
Search Result 1
Search Result 2
Search Result 3
Search Result 4
