Synthesizing constraint expressions

A constraint network representation is presented for a combinatorial search problem: finding values for a set of variables subject to a set of constraints. A theory of consistency levels in such networks is formulated, which is related to problems of backtrack tree search efficiency. An algorithm is developed that can achieve any level of consistency desired, in order to preprocess the problem for subsequent backtrack search, or to function as an alternative to backtrack search by explicitly determining all solutions.

[1]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[2]  Stephen H. Unger,et al.  GIT—a heuristic program for testing pairs of directed line graphs for isomorphism , 1964, CACM.

[3]  Julian R. Ullmann,et al.  Associating Parts of Patterns , 1966, Inf. Control..

[4]  H. Kucera,et al.  Computational analysis of present-day American English , 1967 .

[5]  O. Ore.  The Four-Color Problem , 1967 .

[6]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[7]  Richard Fikes,et al.  REF-ARF: A System for Solving Problems Stated as Procedures , 1970, Artif. Intell..

[8]  D Marr,et al.  Simple memory: a theory for archicortex. , 1971, Philosophical transactions of the Royal Society of London. Series B, Biological sciences.

[9]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[10]  Drew McDermott,et al.  From PLANNER to CONNIVER: a genetic approach , 1972, AFIPS '72 (Fall, part II).

[11]  David L. Waltz,et al.  Generating Semantic Descriptions From Drawings of Scenes With Shadows , 1972 .

[12]  Julian R. Ullmann,et al.  Pattern recognition techniques , 1973 .

[13]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[14]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[15]  Berthold K. P. Horn,et al.  Determining lightness from an image , 1974, Comput. Graph. Image Process..

[16]  Daniel G. Bobrow,et al.  New Programming Languages for Artificial Intelligence Research , 1974, CSUR.

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

[18]  J M Tenenbaum,et al.  MSYS: A System for Reasoning About Scenes. , 1975 .

[19]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[20]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[21]  D Marr,et al.  Cooperative computation of stereo disparity. , 1976, Science.

[22]  Kurt Maly.  Compressed tries , 1976, CACM.

[23]  R. Grossman.  SOME DATA BASE APPLICATIONS OF CONSTRAINT EXPRESSIONS , 1976 .

[24]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

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

[26]  Renzo Sprugnoli,et al.  Perfect hashing functions , 1977, Commun. ACM.

[27]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.