Boosting local consistency algorithms over oating-point numbers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Boosting local consistency algorithms over oating-point numbers

Résumé

Solving constraints over oating-point numbers is a critical issue in numerous applications notably in program verication. Capa-bilities of ltering algorithms over the oating-point numbers (F) have been so far limited to 2b-consistency and its derivatives. Though safe, such ltering techniques suer from the well known pathological prob-lems of local consistencies, e.g., inability to eciently handle multiple occurrences of the variables. These limitations also have their origins in the strongly restricted oating-point arithmetic. To circumvent the poor properties of oating-point arithmetic, we propose in this paper a new ltering algorithm, called FPLP, which relies on various relaxations over the real numbers of the problem over F. Safe bounds of the domains are computed with a mixed integer linear programming solver (MILP) on safe linearizations of these relaxations. Preliminary experiments on a relevant set of benchmarks are promising and show that this approach can be eective for boosting local consistency algorithms over F.
Fichier principal
Vignette du fichier
cp12_fp.pdf (390.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01099514 , version 1 (04-01-2015)

Licence

Paternité - Pas d'utilisation commerciale - Pas de modification

Identifiants

Citer

Mohammed Said Belaid, Claude Michel, Michel Rueher. Boosting local consistency algorithms over oating-point numbers. Principles and Practice of Constraint Programming. 18th International Conference, CP 2012, Oct 2012, Quebec, Canada. pp.127-140, ⟨10.1007/978-3-642-33558-7_12⟩. ⟨hal-01099514⟩
323 Consultations
173 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More