Constraint Propagation Issues in Automated Design

The Constraint Propagation paradigm is a very natural approach to automate design since it basically amounts to determining the value of a set of variables (design variables) linked by constraints. The practical enterprise of developing an automatic design system reveals a host of obstacles. In this paper, we give an account of the major problems and propose ways of tackling them. We report what we call the "boomerang effect" (which occurs when performing design by building blocks assembly) and explain how an algorithm based on it helps reduce its complexity.

[1]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[2]  Mark Jeffrey Stefik.  Planning with constraints , 1980 .

[3]  Earl David Sacerdoti,et al.  A Structure for Plans and Behavior , 1977 .

[4]  Gerald Jay Sussman,et al.  CONSTRAINTS - A Language for Expressing Almost-Hierarchical Descriptions , 1980, Artif. Intell..

[5]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[6]  Jean-Claude Latombe,et al.  Making Compromises Among Antagonist Constraints in a Planner , 1985, Artif. Intell..

[7]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

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

[9]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[10]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[11]  Clive L. Dym,et al.  PRIDE: An Expert System for the Design of Paper Handling Systems , 1986, Computer.

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

[13]  Jean-Louis Laurière,et al.  A Language and a Program for Stating and Solving Combinatorial Problems , 1978, Artif. Intell..

[14]  Patrick Henry Winston,et al.  The psychology of computer vision , 1976, Pattern Recognit..

[15]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[16]  Charles M. Eastman,et al.  Automated Space Planning , 1973, Artif. Intell..

[17]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

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

[19]  L. Brillouin,et al.  Science and information theory , 1956 .

[20]  J. Dekleer.  An assumption-based TMS , 1986 .

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

[22]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[23]  Bernard Nudel,et al.  Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics , 1983, Artif. Intell..

[24]  Rina Dechter,et al.  Removing Redundancies in Constraint Networks , 1987, AAAI.

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