Abstract
We provide here an extension of a general framework introduced in [Apt99b,Apt99c] that allows to explain several local consistency algorithms in a systematic way. In this framework we proceed in two steps. First, we introduce a generic iteration algorithm on partial orderings and prove its correctness. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific local consistency algorithms. In particular, using the notion of subsumption, we show that the algorithms AC4, HAC-4, AC-5 and our extension HAC-5 of AC-5 are instances of a single generic algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt, The Essence of Constraint Propagation, Theoretical Computer Science, 221(1–2), pp. 179–210, 1999.
K.R. Apt, The Rough Guide to Constraint Propagation, Proc. of the 5th International Conference on Principles and Practice of Constraint Programming (CP’99), (invited lecture), Springer-Verlag Lecture Notes in Computer Science 1713, pp. 1–23.
K.R. Apt, The Role of Commutativity in Constraint Propagation Algorithms, submitted for publication.
P. van Hentenryck, Y. Deville and C. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, 57, pp. 291–321, 1992.
K. Marriott and P. Stuckey, Programming with Constraints, MIT Press, 1998.
R. Mohr and T. Henderson, Arc and Path Consistency Revisited, Artificial Intelligence, 28, pp. 225–233, 1986.
R. Mohr and G. Masini, Good old discrete relaxation, Proc. of the 8th European Conference on Artificial Intelligence (ECAI), pp. 651–656, Pitman Publisher, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gennari, R. (2000). Arc Consistency Algorithms via Iterations of Subsumed Functions. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_24
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive