Boosting local consistency algorithms over oating-point numbers

Abstract : 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.
Type de document :
Communication dans un congrès
Principles and Practice of Constraint Programming. 18th International Conference, CP 2012, Oct 2012, Quebec, Canada. Springer Verlag, pp.127-140, 2012, Principles and Practice of Constraint Programming. <http://link.springer.com/chapter/10.1007/978-3-642-33558-7_12>. <10.1007/978-3-642-33558-7_12>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01099514
Contributeur : Michel Rueher <>
Soumis le : dimanche 4 janvier 2015 - 14:34:10
Dernière modification le : mercredi 8 avril 2015 - 16:34:56
Document(s) archivé(s) le : dimanche 5 avril 2015 - 10:11:25

Fichier

cp12_fp.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité - Pas d'utilisation commerciale - Pas de modification 4.0 International License

Identifiants

Collections

Citation

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. Springer Verlag, pp.127-140, 2012, Principles and Practice of Constraint Programming. <http://link.springer.com/chapter/10.1007/978-3-642-33558-7_12>. <10.1007/978-3-642-33558-7_12>. <hal-01099514>

Partager

Métriques

Consultations de
la notice

70

Téléchargements du document

65