Splitting heuristics for disjunctive numerical constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Splitting heuristics for disjunctive numerical constraints

Résumé

Ratschan has recently proposed a general framework for first-order formulas whose atoms are numerical constraints. It extends the notion of consistency to logical terms, but little is done with respect to the splitting operation. In this paper, we explore the potential of splitting heuristics that exploit the logical structure of disjunctive numerical constraint problems in order to simplify the problem along the search. First experiments on CNF formulas show that interesting solving time gains can be achieved by choosing the right splitting points.
Fichier principal
Vignette du fichier
dj-sac08csp.pdf (392.83 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00421462 , version 1 (02-10-2009)

Identifiants

Citer

Thomas Douillard, Christophe Jermann. Splitting heuristics for disjunctive numerical constraints. Symposium on Applied Computing, 2008, Brazil. p. 140-144, ⟨10.1145/1363686.1363725⟩. ⟨hal-00421462⟩
72 Consultations
163 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More