Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
Leon Brillouin Science and Information Theory Academic Press Inc, 1962
James F Brinkley, Bruce G Buchanan, Russ B Altman, Bruce S Duncan, Craig W Cornelius A Heuristic Refinement for Spatial Constraint Satisfaction Problems Stanford University Report No STAN-CS-87-1142 (KSL-87-05), Jan 1987.
Martin C Cooper An Optimal k-Consistency Algorithm Artificial Intelligence 41 (1989:90) 89–95
Ernest Davis Constraint Propagation with Interval Labels Artificial Intelligence 32 (1987) 281–331
Johan de Kleer An Assummtion-based TMS Artificial Intelligence 28 (1986) 127–162
Avi Dechter & Rina Dechter Removing Redundancies in Constraint Networks Sixth National Conference on Artificial Intelligence, Seattle, 1987, 105–109
Rina Dechter & Judea Pearl Tree Clustering for Constraint Networks Artificial Intelligence 38 (1989) 353–366
Yannick Descotte & Jean Claude Latombe Making Compromises among Antagonist Constraints in a Planner Artificial Intelligence 27 (1985) 183–217
Charles M Eastman Automated Space Planning Artificial Intelligence 4 (1973) 41–64
P Freeman and A Newell A model for Functional Reasoning in Design 2nd International Conference on Artificial Intelligence, London, September 1971
Eugene C Freuder Synthesizing Constraint Expressions ACM Communications, Nov 1978, Vol 21 No 11, pp 958–966
John Gaschnig Performance Measurement and analysis of certain search algorithms PhD thesis, Department of Computer Science, CMU, 1979.
Ching-Chih Han & Chia-Hoang Lee Comments on Mohr and Henderson's Arc and Path Consistency Algorithm Artificial Intelligence 36 (1988) 125–130
Robert M Haralick & Gordon L Elliott Increasing Tree Search Efficiency for Constraint Satisfaction Problems Artificial Intelligence 14 (1980) 263–313
Philippe Janssen, Philippe Jégou, Bernard Nouguier & Marie-Catherine Vilarem Design Problems: an approach based on constraint satisfaction (in French) Neuvièmes Journées Internationales sur les Systèmes Experts et Leurs Applications, 71–84
François Ingrand. Inférence de Formes à partir de Fonctions. Application à la Conception de Montage d'Usinage. Thèse de Doctorat de 3ème cycle, INPG, Grenoble, 1987.
Jean Louis Laurière A language and a program for stating and solving combinatorial problems Artificial Intelligence 10 (1978) 29–127
Alan K. Mackworth Consistency in networks of relations Artificial Intelligence 8 (1977) 99–118
Alan K. Mackworth & Eugene C Freuder The complexity of some polynomial network consistency algorithms for constraint satisfaction problems Artificial Intelligence 25 (1985) 65–74
Sanjay Mittal. PRIDE: An Expert System for the Design of Paper Handling Systems. IEEE computer magazine, July 1986, pp 102–114.
Roger Mohr & Thomas Henderson Arc and Path Consistency Revisited Artificial Intelligence 28 (1986) 225–233
Ugo Montanari Network of constraints: Fundamental properties and applications to picture processing Information Sciences 7 (1974) 95–132
Bernard Nudel Consistent-Labeling Problems and their Algorithms: Expected-Complexities and Theory-Based Heuristics Artificial Intelligence 21 (1983) 135–178
Louis A Pipes & Lawrence R Harvill Applied Mathematics for Engineers and Physicists International Student Edition, McGraw Hill Book Co, 1971
Earl D Sacerdoti A Structure for Plans and Behavior Elsevier North Holland, New York, 1977.
Mark Jeffrey Stefik Planning with Constraints PhD thesis, Stanford University, 1980.
Gerald Jay Sussman & Guy Lewis Steele Jr Constraints — A language for expressing almost-hierarchical descriptions Artificial Intelligence 14 (1980) 1–39
Jean Patrick Tsang Planning by Combining Plans. Application to Process Planning Generation (in French) PhD thesis (Thèse de Docteur de l'INPG), Grenoble, 1987.
Jean Patrick Tsang & Daniel Brissaud A Feature Based Approach to Process Planning Proceedings of the ASME International Computers in Engineering Conference, Anaheim, California, July 30–August 3, 1989, Vol 1, pp 419–430.
Jean Patrick Tsang, Bernard Wrobel & Nathalie Pfeffer A Functional Reasoning for Automating the design process (in French) Dixièmes Journées Internationales sur les Systèmes Experts et Leurs Applications, Avignon, pp 151–166.
David L Waltz Understanding line drawings of scenes with shadows in Winston PH ed, The Psychology of Computer Vision McGraw-Hill, New York 1975, pp 19–91
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsang, J.P. (1990). Constraint propagation issues in automated design. In: Gottlob, G., Nejdl, W. (eds) Expert Systems in Engineering Principles and Applications. ESE 1990. Lecture Notes in Computer Science, vol 462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53104-1_38
Download citation
DOI: https://doi.org/10.1007/3-540-53104-1_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53104-3
Online ISBN: 978-3-540-46711-3
eBook Packages: Springer Book Archive