Abstract
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm called AC2001 and AC3.1 has been independently presented by their authors. This algorithm which is considered as a refinement of the basic algorithm AC3 has the advantage of being simple and competitive. However, it does not take into account constraint bidirectionality as AC7 does. In this paper, we address this issue, and, in particular, introduce two new algorithms called AC3.2 and AC3.3 which benefit from good properties of both AC3 and AC7. Indeed, AC3.2 and AC3.3 are as easy to implement as AC3 and take advantage of bidirectionality as AC7 does. More precisely, AC3.2 is a general algorithm which partially exploits bidirectionality whereas AC3.3 is a binary algorithm which fully exploits bidirectionality. It turns out that, when Maintaining Arc Consistency during search, MAC3.2, due to a memorization effect, is more efficient than MAC3.3 both in terms of constraint checks and cpu time. Compared to MAC2001/3.1, our experimental results show that MAC3.2 saves about 50% of constraint checks and, on average, 15% of cpu time.
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
Bessiere, C.: Arc consistency and arc consistency again. Artificial Intelligence 65, 179–190 (1994)
Bessiere, C., Freuder, E.C., Regin, J.C.: Using constraint metaknowledge to reduce arc consistency computation. Artificial Intelligence 107, 125–148 (1999)
Bessiere, C., Regin, J.C.: MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 61–75. Springer, Heidelberg (1996)
Bessiere, C., Regin, J.C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of IJCAI 1997 (1997)
Bessiere, C., Regin, J.C.: Refining the basic constraint propagation algorithm. In: Proceedings of IJCAI 2001, pp. 309–315 (2001)
Lecoutre, C., Boussemart, F., Hemery, F.: Revision ordering heuristics for the constraint satisfaction problem. (2003) (in submission)
Lecoutre, C., Boussemart, F., Hemery, F., Merchez, S.: Abscon 2.0, a constraint programming platform (September 2003), http://www.cril.univ-artois.fr/~lecoutre
Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8(1), 118–126 (1977)
Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence 28, 225–233 (1986)
Sabin, D., Freuder, E.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of the PPCPA 1994, Seattle WA (1994)
Smith, B.M., Grant, S.A.: Trying harder to fail first. In: Proceedings of ECAI 1998, Brighton, UK, pp. 249–253 (1998)
Smith, B.M., Stergiou, K., Walsh, T.: Modelling the Golomb ruler problem. Technical Report 1999.12, University of Leeds (1999)
van Dongen, M.R.C.: AC3 d an efficient arc consistency algorithm with a low space complexity. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 755–760. Springer, Heidelberg (2002)
van Dongen, M.R.C.: Lightweight arc-consistency algorithms. Technical Report TR-01- 2003, University college Cork (2003)
Wallace, R.J., Freuder, E.C.: Ordering heuristics for arc consistency algorithms. In: Proceedings of NCCAI 1992, pp. 163–169 (1992)
Xu, K., Li, W.: Many hard examples in exact phase transition (2002) (submitted)
Zhang, Y., Yap, R.H.C.: Making AC3 an optimal algorithm. In: Proceedings of IJCAI 2001, Seattle WA, pp. 316–321 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lecoutre, C., Boussemart, F., Hemery, F. (2003). Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive