Exploiting Weak Dependencies in Tree-based Search - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Exploiting Weak Dependencies in Tree-based Search

(1) , (2)
1
2
Alejandro Arbelaez
  • Function : Author
  • PersonId : 856329
Youssef Hamadi
  • Function : Author
  • PersonId : 840368

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.
Fichier principal
Vignette du fichier
SAC-functdep.pdf (138.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00344179 , version 1 (03-12-2008)

Identifiers

  • HAL Id : inria-00344179 , version 1

Cite

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⟩

Collections

INRIA
135 View
306 Download

Share

Gmail Facebook Twitter LinkedIn More