An enhancement scheme for constraint satisfaction problems (CSPs)

References

• Bruynooghe , M. 1981 . Solving combinatorial search problems by intelligent back-tracking . Info. Process. Lett. , 12 : 36 – 39 .
   Google Scholar
• Haralick , R. M. and Elliot , G. L. 1980 . Increasing tree search efficiency for constraint satisfaction problems . Artif. Intell. , 14 : 263 – 313 .
   Web of Science ®Google Scholar
• Dechter , Rina . 1989/90 . Enhancement schemes for constraint processing: Back-jumping, learning and cutset decomposition . Artif. Intell. , 41 : 173 – 312 .
   Google Scholar
• Gaschnig J. Performance measurement and analysis of certain search algorithms Carnegie-Mellon University Pittsburgh, PA 1979 Tech. Rept. CMU-CS-79-124
   Google Scholar
• Purdom , P. W. 1983 . Search rearrangement back-jumping and polynomial average time . Artif Intell. , 21 : 117 – 133 .
   Google Scholar
• Nadel , B. 1983 . Constraint labeling problems and their algorithms, Expected complexities and theory based heuristics . Artif Intell. , 21 : 135 – 178 .
   Google Scholar
• Dechter , R. and Pearl , J. 1987 . Network-based heuristics for constraint satisfaction problems . Artif. Intell. , 34 : 1 – 38 .
   Google Scholar
• Mackworth , A. K. 1977 . Consistency in networks of relations . Artif Intell. , 8 : 99 – 118 .
   Web of Science ®Google Scholar
• Montanary , U. 1974 . Networks of constraints: Fundamental properties and applications to picture processing . Inf. Sci. , 7 : 95 – 132 .
   Google Scholar
• Freuder , E. C. 1982 . A sufficient condition for backtrack free search . J. ACM , 29 : 24 – 32 .
   Web of Science ®Google Scholar