Arc-Consistency and Arc-Consistency Again - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Artificial Intelligence Year : 1994

Arc-Consistency and Arc-Consistency Again

Abstract

There is no need to show the importance of arc-consistency in Constraint Networks. Mohr and Henderson [9] have proposed AC-4, an algorithm with optimal worst-case time complexity. But it has two drawbacks: its space complexity and average time complexity. In problems with many solutions, where constraints are large, these drawbacks become so important that users often replace AC-4 by AC-3 [8], a non-optimal algorithm. In this paper, we propose a new algorithm, AC-6, which keeps the optimal worst-case time complexity of AC-4 while working out the drawback of space complexity. Moreover, the average time complexity of AC-6 is optimal for constraint networks where nothing is known about the constraint semantics.
Fichier principal
Vignette du fichier
aij94.pdf (229.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-02310614 , version 1 (10-10-2019)

Identifiers

Cite

Christian Bessiere. Arc-Consistency and Arc-Consistency Again. Artificial Intelligence, 1994, 65 (1), pp.179-190. ⟨10.1016/0004-3702(94)90041-8⟩. ⟨lirmm-02310614⟩
39 View
400 Download

Altmetric

Share

Gmail Facebook X LinkedIn More