Synthesizing Constraint Expressions

Communications of the ACM

Volumn 21, Issue 11, 1978, Pages 958-966

  Freuder, Eugene C ^a  

^a UNIVERSITY OF NEW HAMPSHIRE   (United States)

Author keywords

backtrack; combinatorial algorithms; constraint networks; constraint satisfaction; graph coloring; network consistency; relaxation; scene labeling; search

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0018031196     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359642.359654     Document Type: Article

References (24)

1. Barrow, H.G., and Tenenbaum, J.M. MSYS: A system for reasoning about scenes. Tech. Note 121, A.I. Ctr., Stanford Research Inst., Menlo Park, Calif., April 1976.
2. Bobrow, D.G., and Raphael, B. New programming languages for artificial intelligence research. Computing Surveys 6, 3(1974), 153-174.
3. Clowes, M.B. On seeing things. Artif. Intell. 2 (1971), 79-116.
4. Cook, S.A. The complexity of theorem-proving procedures. Conf. Rec. 3rd Annual ACM Symp. Theory of Computing, 1971, pp. 151-158.
5. Fikes, R.E. REF-ARF: A system for solving problems stated as procedures. Artif. Intell. I, 1(1970), 27-120.
6. Freuder, E.C. Synthesizing constraint expressions, A.I. Memo 370, A.I. Lab., M.I.T., Cambridge, Mass., 1976.
7. Grossman, R.W. Some data base applications of constraint expressions. TR 158, Lab. for Computer Science, M.I.T., Cambridge, Mass., 1976.
8. Horn, B.K.P. Determining lightness from an image. Comptr. Graphics and Image Processing 3, 4(Dec. 1974), 277-299.
9. Huffman, D.A. Impossible objects as nonsense sentences. In Machine Intelligence 6, B. Meltzer and D. Michie, Eds., Edinburgh U. Press, Edinburgh, 1971, pp. 295-323.
10. Mackworth, A.K. Consistency in networks of relations. Artif. Intell. 8, 1(1977), 99-118.
11. Marr, D. Simple memory: A theory for archicortex. Philos. Trans. Roy. Soc. B. 252 (1971), 23-81.
12. Marr, D., and Poggio, T. Cooperative computation of stereo disparity. A.I. Memo 364, A.I. Lab., M.I.T., Cambridge, Mass., 1976.
13. Minsky, M., and Papert, S. Perceptrons. M.I.T. Press, Cambridge, Mass., 1968.
14. Montanari, U. Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci. 7, 2 (April 1974), 95-132.
15. Rosenfeld, A., Hummel, R., and Zucker, S.W. Scene labelling by relaxation operations. IEEE Trans. Systems, Man, and Cybernetics SMC-6, 6 (June 1976), 420-433.
16. Sussman, G.J., and McDermott, D.V. From PLANNER to CONNIVER—a genetic approach. Proc. AFIPS 1972 FJCC, Vol. 41, AFIPS Press, Montvale, N.J., pp. 1171-1179.
17. Sussman, G.J., and Stallman, R.M. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. A.I. Memo 380, A.I. Lab., M.I.T., Cambridge, Mass., 1976.
18. Tenenbaum, J.M., and Barrow, H.G. IGS: A paradigm for integrating image segmentation and interpretation. In Pattern Recognition and Artificial Intelligence, C. H. Chen, Ed., Academic Press, New York, 1976, pp. 472-507.
19. Ullman, J.R. Associating parts of patterns. Inform, and Control 9, 6 (Dec. 1966), 583-601.
20. Ullman, J. R. Pattern Recognition Techniques. Crane Russak, New York, 1973.
21. Ullman, J.R. An algorithm for subgraph isomorphism. J.ACM 23, 1 (Jan. 1976), 31-42.
22. Unger, S.H. GIT—a heuristic program for testing pairs of directed line graphs for isomorphism. Comm. ACM 7, 1 (Jan. 1964), 26-34.
23. Waltz, D.L. Generating semantic descriptions from drawings of scenes with shadows. AI-TR-271, A.I. Lab., M.I.T., Cambridge, Mass., 1972.
24. Zucker, S.W. Relaxation labelling, local ambiguity, and low-level vision. In Pattern Recognition and Artificial Intelligence, C. H. Chen, Ed., Academic Press, New York, 1976, pp. 593-616