Characterising Tractable Constraints

Abstract Finding solutions to a binary constraint satisfaction problem is known to be an NP-complete problem in general, but may be tractable in cases where either the set of allowed constraints or the graph structure is restricted. This paper considers restricted sets of constraints which are closed under permutation of the labels. We identify a set of constraints which gives rise to a class of tractable problems and give polynomial time algorithms for solving such problems, and for finding the equivalent minimal network. We also prove that the class of problems generated by any set of constraints not contained in this restricted set is NP-complete.

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

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

[3]  Chia-Hoang Lee,et al.  Comments on Mohr and Henderson's Path Consistency Algorithm , 1988, Artif. Intell..

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[6]  Rina Dechter,et al.  Network-based heuristics for constraint satisfaction problems , 1988 .

[7]  Lefteris M. Kirousis.  Fast Parallel Constraint Satisfaction , 1993, ICALP.

[8]  Peter van Beek,et al.  On the Minimality and Decomposability of Constraint Networks , 1992, AAAI.

[9]  Rina Dechter,et al.  From Local to Global Consistency , 1990, Artif. Intell..

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

[11]  Julian R. Ullmann,et al.  An investigation of occlusion in one dimension , 1983, Comput. Vis. Graph. Image Process..

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

[13]  Martin C. Cooper.  Visual occlusion and the interpretation of ambiguous pictures , 1992 .

[14]  Peter van Beek,et al.  On the minimality and global consistency of row-convex constraint networks , 1995, JACM.

[15]  Marc Gyssens,et al.  Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..

[16]  Francesca Rossi,et al.  Constraint Relaxation may be Perfect , 1991, Artif. Intell..

[17]  Martin C. Cooper.  An Optimal k-Consistency Algorithm , 1989, Artif. Intell..

[18]  Eugene C. Freuder.  A sufficient condition for backtrack-bounded search , 1985, JACM.