Abstract
Constraint satisfaction problems are traditionally solved using some form of backtrack search that propagates constraints after each decision is made. The efficiency of search relies heavily on the use of good variable and value ordering heuristics. In this paper we show that constraints can also be used to guide the search process by actively proposing the next choice point to be branched on. We show that search effort can be reduced significantly.
| Original language | English |
|---|---|
| Title of host publication | ECAI 2006 |
| Subtitle of host publication | 17th European Conference on Artificial Intelligence August 29 - September 1, 2006, Riva del Garda, Italy |
| Editors | Gerhard Brewka, Silvia Coradeschi, Anna Perini, Paolo Traverso |
| Publisher | IOS Press BV |
| Pages | 158-162 |
| Number of pages | 5 |
| ISBN (Print) | 9781586036423 |
| Publication status | Published - 2006 |
Publication series
| Name | Frontiers in Artificial Intelligence and Applications |
|---|---|
| Volume | 141 |
| ISSN (Print) | 0922-6389 |
| ISSN (Electronic) | 1879-8314 |