Skip to main content

Constraint propagation issues in automated design

  • Planning/Design/Scheduling
  • Conference paper
  • First Online:
Expert Systems in Engineering Principles and Applications (ESE 1990)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 462))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Leon Brillouin Science and Information Theory Academic Press Inc, 1962

    Google Scholar 

  2. 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.

    Google Scholar 

  3. Martin C Cooper An Optimal k-Consistency Algorithm Artificial Intelligence 41 (1989:90) 89–95

    Google Scholar 

  4. Ernest Davis Constraint Propagation with Interval Labels Artificial Intelligence 32 (1987) 281–331

    Google Scholar 

  5. Johan de Kleer An Assummtion-based TMS Artificial Intelligence 28 (1986) 127–162

    Google Scholar 

  6. Avi Dechter & Rina Dechter Removing Redundancies in Constraint Networks Sixth National Conference on Artificial Intelligence, Seattle, 1987, 105–109

    Google Scholar 

  7. Rina Dechter & Judea Pearl Tree Clustering for Constraint Networks Artificial Intelligence 38 (1989) 353–366

    Google Scholar 

  8. Yannick Descotte & Jean Claude Latombe Making Compromises among Antagonist Constraints in a Planner Artificial Intelligence 27 (1985) 183–217

    Google Scholar 

  9. Charles M Eastman Automated Space Planning Artificial Intelligence 4 (1973) 41–64

    Google Scholar 

  10. P Freeman and A Newell A model for Functional Reasoning in Design 2nd International Conference on Artificial Intelligence, London, September 1971

    Google Scholar 

  11. Eugene C Freuder Synthesizing Constraint Expressions ACM Communications, Nov 1978, Vol 21 No 11, pp 958–966

    Google Scholar 

  12. John Gaschnig Performance Measurement and analysis of certain search algorithms PhD thesis, Department of Computer Science, CMU, 1979.

    Google Scholar 

  13. Ching-Chih Han & Chia-Hoang Lee Comments on Mohr and Henderson's Arc and Path Consistency Algorithm Artificial Intelligence 36 (1988) 125–130

    Google Scholar 

  14. Robert M Haralick & Gordon L Elliott Increasing Tree Search Efficiency for Constraint Satisfaction Problems Artificial Intelligence 14 (1980) 263–313

    Google Scholar 

  15. 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

    Google Scholar 

  16. 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.

    Google Scholar 

  17. Jean Louis Laurière A language and a program for stating and solving combinatorial problems Artificial Intelligence 10 (1978) 29–127

    Google Scholar 

  18. Alan K. Mackworth Consistency in networks of relations Artificial Intelligence 8 (1977) 99–118

    Google Scholar 

  19. Alan K. Mackworth & Eugene C Freuder The complexity of some polynomial network consistency algorithms for constraint satisfaction problems Artificial Intelligence 25 (1985) 65–74

    Google Scholar 

  20. Sanjay Mittal. PRIDE: An Expert System for the Design of Paper Handling Systems. IEEE computer magazine, July 1986, pp 102–114.

    Google Scholar 

  21. Roger Mohr & Thomas Henderson Arc and Path Consistency Revisited Artificial Intelligence 28 (1986) 225–233

    Google Scholar 

  22. Ugo Montanari Network of constraints: Fundamental properties and applications to picture processing Information Sciences 7 (1974) 95–132

    Google Scholar 

  23. Bernard Nudel Consistent-Labeling Problems and their Algorithms: Expected-Complexities and Theory-Based Heuristics Artificial Intelligence 21 (1983) 135–178

    Google Scholar 

  24. Louis A Pipes & Lawrence R Harvill Applied Mathematics for Engineers and Physicists International Student Edition, McGraw Hill Book Co, 1971

    Google Scholar 

  25. Earl D Sacerdoti A Structure for Plans and Behavior Elsevier North Holland, New York, 1977.

    Google Scholar 

  26. Mark Jeffrey Stefik Planning with Constraints PhD thesis, Stanford University, 1980.

    Google Scholar 

  27. Gerald Jay Sussman & Guy Lewis Steele Jr Constraints — A language for expressing almost-hierarchical descriptions Artificial Intelligence 14 (1980) 1–39

    Google Scholar 

  28. 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.

    Google Scholar 

  29. 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.

    Google Scholar 

  30. 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.

    Google Scholar 

  31. 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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Georg Gottlob Wolfgang Nejdl

Rights and permissions

Reprints 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

Publish with us

Policies and ethics