Skip to Main content Skip to Navigation
Journal articles

An Optimal Coarse-Grained Arc Consistency Algorithm

Christian Bessière 1, * Jean-Charles Régin 2 Roland Yap 2 Yuanlin Zhang 2
* Corresponding author
1 COCONUT - Agents, Apprentissage, Contraintes
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : The use of constraint propagation is the main feature of any constraint solver. It is thus of prime importance to manage the propagation in an efficient and effective fashion. There are two classes of propagation algorithms for general constraints: fine-grained algorithms where the removal of a value for a variable will be propagated to the corresponding values for other variables, and coarse-grained algorithms where the removal of a value will be propagated to the related variables. One big advantage of coarse-grained algorithms, like AC-3, over fine-grained algorithms, like AC-4, is the ease of integration when implementing an algorithm in a constraint solver. However, fine-grained algorithms usually have optimal worst case time complexity while coarse-grained algorithms do not. For example, AC-3 is an algorithm with non-optimal worst case complexity although it is simple, efficient in practice, and widely used. In this paper we propose a coarse-grained algorithm, AC2001/3.1, that is worst case optimal and preserves as much as possible the ease of its integration into a solver (no heavy data structure to be maintained during search). Experimental results show that AC2001/3.1 is competitive with the best fine-grained algorithms such as AC-6. The idea behind the new algorithm can immediately be applied to obtain a path consistency algorithm that has the best-known time and space complexity. The same idea is then extended to non-binary constraints.
Document type :
Journal articles
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00105310
Contributor : Christine Carvalho de Matos <>
Submitted on : Wednesday, October 11, 2006 - 7:51:20 AM
Last modification on : Thursday, May 14, 2020 - 6:58:06 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 7:17:13 PM

File

Identifiers

Collections

Citation

Christian Bessière, Jean-Charles Régin, Roland Yap, Yuanlin Zhang. An Optimal Coarse-Grained Arc Consistency Algorithm. Artificial Intelligence, Elsevier, 2005, 165 (2), pp.165-185. ⟨10.1016/j.artint.2005.02.004⟩. ⟨lirmm-00105310⟩

Share

Metrics

Record views

193

Files downloads

574