References
- Davis , L. S. and Rosenfield , A. 1981 . Cooperating processes for low-level vision: a survey . Artificial Intelligence , 17 : 245 – 263 .
- Dechter , R. 1990 . Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition . Artificial Intelligence , 41 : 273 – 312 .
- Dechter , R. and Pearl , J. 1988 . Network based heuristics for constraint satisfaction problems . Artificial Intelligence , 34 : 1 – 38 .
- Dechter , R. and Pearl , J. 1989 . Tree-clustering schemes for the constraint processing . Artificial Intelligence , 38 : 353 – 366 .
- Freuder , E. C. 1982 . A sufficient condition of backtrack-free search . J ACM , 29 ( 1 ) : 24 – 32 .
- Garey , R. M. and Johnson , D. S. 1979 . “ Computers and Intractibility ” . In Freeman San Francisco
- Haralick , H. M. and Elliot , G. L. 1980 . Increasing tree search efficiency for constraint satisfaction problems . Artificial Intelligence , 14
- Jégou , P. Cyclic-clustering: a compromise between tree-clustering and cycle-cutset method for improving search efficiency . Proceedings of the ECAI-90 , 369 – 371 .
- Nadel , B. A. 1989 . Constraint satisfaction algorithms . Comput. Intell , 5 ( 4 ) : 188 – 224 .
- Paton , K. 1969 . An algorithm for finding a fundamental cycle set of a graph . Comm. ACM , 12 : 514 – 518 .
- Reingold , E. M. , Nievergelt , J. and Deo , N. 1977 . “ Combinatorial algorithms: theory and practice ” . Englewood Cliffs, NJ : Prentice Hall, Inc. .
- Stefik , M. 1981 . Planning with constraints . Artificial Intelligence , 16 : 111 – 139 .
- Waltz , D. 1975 . “ Understanding line drawings of scenes and shawdows ” . In The Psychology of Computer Vision , Edited by: Winston , P. H. 19 – 91 . New York : McGraw-Hill .