Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [11 references]  Display  Hide  Download

Contributor : Alejandro Arbelaez Connect in order to contact the contributor
Submitted on : Wednesday, December 3, 2008 - 11:10:47 PM
Last modification on : Friday, February 4, 2022 - 3:19:25 AM
Long-term archiving on: : Thursday, October 11, 2012 - 12:31:17 PM


Files produced by the author(s)


  • HAL Id : inria-00344179, version 1



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⟩



Record views


Files downloads