Arc-Consistency and Arc-Consistency Again - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Artificial Intelligence Année : 1994

Arc-Consistency and Arc-Consistency Again

Résumé

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
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
40 Consultations
420 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More