Abstract
Arc-consistency algorithms prune the search-space of Constraint Satisfaction Problems (CSPs). They use support-checks to find out about the properties of CSPs. Their arc-heuristics select the constraint and their domain-heuristics select the values for the next support-check. We shall combine AC-3 and DEE and equip the resulting hybrid with a double-support domain-heuristic. The resulting hybrid AC-3d is easy to implement and requires the same data structures as AC-3 thereby improving on AC-7’s space-complexity. We shall present experimental results which indicate that AC-3 can compete with AC-7.
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
C. Bessière, E. C. Freuder, and J.-C. Régin. Using inference to reduce arc consistency computation. In C.S. Mellish, editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI’95), volume 1, pages 592–598, Montréal, Québec, Canada, 1995. Morgan Kaufmann Publishers, Inc., San Mateo, California, USA.
C. Bessière, E. G. Freuder, and J.-C. Régin. Using constraint metaknowledge to reduce arc consistency computation. Artificial Intelligence, 107(1):125–148, 1999.
J. Gaschnig. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. In Proceeding of the Second Biennial Conference, Canadian Society for the Computational Studies of Intelligence, pages 268–277, 1978.
A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.
A. K. Mackworth and E. C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25(1):65–73, 1985.
M. R. C. van Dongen. Constraints, Varieties, and Algorithms. PhD thesis, Department of Computer Science, University College, Cork, Ireland, 2002.
M. R. C. van Dongen. AC-3d an efficient arc-consistency algorithm with a low space-complexity. Technical Report TR-01-2002, Cork Constraint Computation Centre, 2002.
R. J. Wallace and E. C. Freuder. Ordering heuristics for arc consistency algorithms. In AI/GI/VI’ 92, pages 163–169, Vancouver, British Columbia, Canada, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Dongen, M.R.C. (2002). AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_58
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive