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

Arc and Path Consistency Revisited

Résumé

Mackworth and Freuder have analyzed the time complexity of several constraint satisfaction algorithms [5]. We present here new algorithms for arc and path consistency and show that the arc consistency algorithm is optimal in time complexity and of the same-order space complexity as the earlier algorithms. A refined solution for the path consistency problem is proposed. However, the space complexity of the path consistency algorithm makes it practicable only for small problems. These algorithms are the result of the synthesis techniques used in Image (a general constraint satisfaction system) and local consistency methods [3].

Dates et versions

inria-00548487 , version 1 (20-12-2010)

Identifiants

Citer

Roger Mohr, Thomas Henderson. Arc and Path Consistency Revisited. Artificial Intelligence, 1986, 28, pp.225--233. ⟨10.1016/0004-3702(86)90083-4⟩. ⟨inria-00548487⟩

Collections

CNRS UNIV-LORRAINE
235 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More