Efficient Algorithms for Singleton Arc Consistency - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

Efficient Algorithms for Singleton Arc Consistency

Résumé

In this paper, we propose two original and efficient approaches for enforcing singleton arc consistency. In the first one, the data structures used to enforce arc consistency are shared between all subproblems where a domain is reduced to a singleton. This new algorithm is not optimal but it requires far less space and is often more efficient in practice than the optimal algorithm SAC-Opt. In the second approach, we perform several runs of a greedy search (where at each step, arc consistency is maintained), possibly detecting the singleton arc consistency of several values in one run. It is an original illustration of applying inference (i.e., establishing singleton arc consistency) by search. Using a greedy search allows benefiting from the incrementality of arc consistency, learning relevant information from conflicts and, potentially finding solution(s) during the inference process. We present extensive experiments that show the benefit of our two approaches.
Fichier principal
Vignette du fichier
constraints10-sac.pdf (300.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00487760 , version 1 (31-05-2010)

Identifiants

  • HAL Id : hal-00487760 , version 1

Citer

Christian Bessiere, Stéphane Cardon, Romuald Debruyne, Christophe Lecoutre. Efficient Algorithms for Singleton Arc Consistency. 2010. ⟨hal-00487760⟩
277 Consultations
250 Téléchargements

Partager

Gmail Facebook X LinkedIn More