Exploiting Weak Dependencies in Tree-based Search

Abstract : In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations are used to rank the variables. Our method shows that these relations can be detected with some acceptable overhead during constraint propagation. More precisely, each time a variable y gets instantiated as a result of the instantiation of x, a weak dependency (x,y) is recorded. As a consequence, the weight of x is raised, and the variable becomes more likely to be selected by the variable ordering heuristic. Experiments on a large set of problems show that on the average, the search trees are reduced by a factor 3 while runtime is decreased by 31% when compared against dom-wdeg, one of the best dynamic variable ordering heuristic.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00344179
Contributor : Alejandro Arbelaez <>
Submitted on : Wednesday, December 3, 2008 - 11:10:47 PM
Last modification on : Thursday, December 4, 2008 - 11:01:12 PM
Long-term archiving on: Thursday, October 11, 2012 - 12:31:17 PM

File

SAC-functdep.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00344179, version 1

Collections

Citation

Alejandro Arbelaez, Youssef Hamadi. Exploiting Weak Dependencies in Tree-based Search. 24th Annual ACM Symposium on Applied Computing, Mar 2009, Honolulu, United States. ⟨inria-00344179⟩

Share

Metrics

Record views

326

Files downloads

355