Making AC-3 an Optimal Algorithm

The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically efficient and extensible. However its worst case time complexity was not considered optimal since the first complexity result for AC-3 [Mackworth and Freuder, 1985] with the bound O(ed3), where e is the number of constraints and d the size of the largest domain. In this paper, we show suprisingly that AC-3 achieves the optimal worst case time complexity with O(ed2). The result is applied to obtain a path consistency algorithm which has the same time and space complexity as the best known theoretical results. Our experimental results show that the new approach to AC-3 is comparable to the traditional AC-3 implementation for simpler problems where AC-3 is more efficient than other algorithms and significantly faster on hard instances.

[1]  Toby Walsh,et al.  The Constrainedness of Arc Consistency , 1997, CP.

[2]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[3]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[4]  Moninder Singh.  Path Consistency Revisited , 1996, Int. J. Artif. Intell. Tools.

[5]  Roland H. C. Yap,et al.  Arc Consistency on n-ary Monotonic and Linear Constraints , 2000, CP.

[6]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[7]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[8]  Yishai A. Feldman,et al.  Portability by automatic translation: a large-scale case study , 1999 .

[9]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[10]  Christian Bessiere,et al.  Using Constraint Metaknowledge to Reduce Arc Consistency Computation , 1999, Artif. Intell..

[11]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[12]  Philippe Jégou,et al.  Path-Consistency: When Space Misses Time , 1996, AAAI/IAAI, Vol. 1.

[13]  Eugene C. Freuder,et al.  Ordering Heuristics for Arc Consistency Algorithms , 1992 .

[14]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[15]  Richard J. Wallace,et al.  Why AC-3 is Almost Always Better than AC4 for Establishing Arc Consistency in CSPs , 1993, IJCAI.

[16]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .