Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Efficient Algorithms for Singleton Arc Consistency

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Romuald Debruyne Connect in order to contact the contributor
Submitted on : Monday, May 31, 2010 - 9:28:23 AM
Last modification on : Tuesday, October 19, 2021 - 2:08:17 PM
Long-term archiving on: : Friday, October 19, 2012 - 3:11:56 PM


Files produced by the author(s)


  • HAL Id : hal-00487760, version 1


Christian Bessière, Stephane Cardon, Romuald Debruyne, Christophe Lecoutre. Efficient Algorithms for Singleton Arc Consistency. 2010. ⟨hal-00487760⟩



Record views


Files downloads