Abstract

Constraint networks are known as a useful way to formulate problems such as design, scene labeling, temporal reasoning, and more recently natural language parsing. The problem of the existence of solutions in a constraint network is NP-complete. Hence, consistency techniques have been widely studied to simplify constraint networks before or during the search of solutions. Arc-consistency is the most used of them. Mohr and Henderson [Moh&Hen86] have proposed AC-4, an algorithm having an optimal worst-case time complexity. But it has two drawbacks: its space complexity and its average time complexity. In problems with many solutions, where the size of the constraints is large, these drawbacks become so important that users often replace AC-4 by AC-3 [Mac&Fre85], a nonoptimal algorithm. In this paper, we propose a new algorithm, AC-6, which keeps the optimal worst-case time complexity of AC-4 while working out the drawback of space complexity. More, the average time complexity of AC-6 is optimal for constraint networks where nothing is known about the semantic of the constraints. At the end of the paper, experimental results show how much AC-6 outperforms AC-3 and AC-4. 1.

Citations

308	Understanding line drawings of scenes with shadows - WALTZ - 1975
249	The constraint logic programming language CHIP, Fifth Generation Computer Systems - Dincbas, Hentenryck, et al. - 1988
247	The complexity of some polynomial network consistency algorithms for constraint satisfaction problems - Mackworth, Freuder - 1985
176	A generic arc-consistency algorithm and its specializations - Hentenryck, Deville, et al. - 1992
76	Arc Consistency in Dynamic Constraint Satisfaction problems - Bessière - 1991
42	Ordering heuristics for arc consistency algorithms - Wallace, Freuder - 1992
38	Hentenryck, An efficient arc consistency algorithm for a class of CSP problems - Deville, Van - 1991
38	Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs - Wallace - 1993
37	Tree search and arc consistency in constraint satisfaction algorithms - Nadel - 1988
27	Arc consistency for factorable relations - Perlin - 1992
24	Hentenryck, Constraint Satisfaction in Logic Programming - Van - 1989
14	Enhancement Schemes for Constraint - Dechter - 1990
12	Increasing tree seach efficiency for constraint satisfaction problems - Haralick, Elliott - 1980
7	Running efficiently arc consistency - Mohr, Masini - 1988
7	Arc-consistency in Dynamic Constraint Satisfaction Problems - Bessire - 1991
3	Constraint Processing Incorporating Backjumping, Learning and Cutset-Decomposition - Dechter - 1988
2	RESYN : Un syst`eme d'aide `a la conception de plans de synth`ese en chimie organique - Vismara, R'egin, et al. - 1992