Name
Abstract | ||
|---|---|---|
In this paper, we propose an approach to guide search to sources of conflicts. The principle is the following: the last variable involved in the last conflict is selected in priority, as long as the constraint network can not be made consistent, in order to find the (most recent) culprit variable, following the current partial instantiation from the leaf to the root of the search tree. In other words, the variable ordering heuristic is violated, until a backtrack to the culprit variable occurs and a singleton consistent value is found. Consequently, this way of reasoning can easily be grafted to many search algorithms and represents an original way to avoid thrashing. Experiments over a wide range of benchmarks demonstrate the effectiveness of this approach. |
Year | Venue | Keywords |
|---|---|---|
2006 | ECAI | constraint network,last variable,last conflict,search tree,culprit variable,search algorithm,current partial instantiation,singleton consistent value,wide range |
Field | DocType | Volume |
Heuristic,Mathematical optimization,Search algorithm,Computer science,Beam search,Thrashing,Artificial intelligence,Singleton,Machine learning,Search tree | Conference | 141 |
ISSN | ISBN | Citations |
0922-6389 | 1-58603-642-4 | 7 |
PageRank | References | Authors |
0.54 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christophe Lecoutre | 1 | 709 | 45.10 |
| Lakhdar Sais | 2 | 859 | 65.57 |
| Sébastien Tabary | 3 | 66 | 6.58 |
| Vincent Vidal | 4 | 108 | 6.38 |