HAL : hal-00487760, version 1

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

Efficient Algorithms for Singleton Arc Consistency

Christian Bessière 1, Stephane Cardon 2, Romuald Debruyne 3, Christophe Lecoutre 2

(2010)

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.

1 :	Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM)
	CNRS : UMR5506 – Université Montpellier II - Sciences et Techniques du Languedoc
2 :	Centre de Recherche en Informatique de Lens (CRIL)
	Université d'Artois – CNRS : UMR8188
3 :	Laboratoire d'Informatique de Nantes Atlantique (LINA)
	CNRS : UMR6241 – Université de Nantes – Ecole des Mines de Nantes

Domaine

:

Informatique/Intelligence artificielle

Mots Clés : Singleton Arc Consistency – Consistances de Singleton – Algorithms – Algorithmes

hal-00487760, version 1

http://hal.archives-ouvertes.fr/hal-00487760

oai:hal.archives-ouvertes.fr:hal-00487760

Contributeur : Romuald Debruyne <>

Soumis le : Lundi 31 Mai 2010, 09:28:23

Dernière modification le : Lundi 31 Mai 2010, 09:39:20