New Light on Arc Consistency over Continuous Domains

Gilles Chabert 1 Gilles Trombettoni Bertrand Neveu
1 COPRIN - Constraints solving, optimization and robust interval analysis
CRISAM - Inria Sophia Antipolis - Méditerranée , ENPC - École des Ponts ParisTech
Abstract : Hyvönen and Faltings observed that propagation algorithms with continuous variables are computationally extremely inefficient when unions of intervals are used to precisely store refinements of domains. These algorithms were designed in the hope of obtaining the interesting property of arc consistency, that guarantees every value in domains to be consistent w.r.t. every constraint. In the first part of this report, we show that a pure backtrack-free filtering algorithm enforcing arc consistency will never exist. But surprisingly, we show that it is easy to obtain a property stronger than arc consistency with a few steps of bisection. We define this so-called box-set consistency and detail a generic method to enforce it. In the second part, a concrete algorithm, derived from the lazy version of the generic method is proposed. Correctness is proved and the properties are studied precisely.
Type de document :
RR-5365, INRIA. 2004, pp.26
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger
Contributeur : Rapport de Recherche Inria <>
Soumis le : vendredi 19 mai 2006 - 21:05:41
Dernière modification le : samedi 27 janvier 2018 - 01:30:51
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:37:53



  • HAL Id : inria-00070638, version 1



Gilles Chabert, Gilles Trombettoni, Bertrand Neveu. New Light on Arc Consistency over Continuous Domains. RR-5365, INRIA. 2004, pp.26. 〈inria-00070638〉



Consultations de la notice


Téléchargements de fichiers