[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Towards automated development of specialized algorithms for design synthesis: Knowledge compilation as an approach to computer-aided design

  • Published:
Research in Engineering Design Aims and scope Submit manuscript

Abstract

We describe the emerging area of artificial intelligence research on “knowledge compilation,” the transformation of explicitly represented knowledge about a domain into an efficient algorithm for performing some task in that domain. In particular, we are interested in the case where the task is design synthesis. We survey several research projects based on this approach, and we use an example of geartrain design from the DIOGENES project to illustrate it in detail. We assess the potential of this approach for improving computer-aided design and identify some of the obstacles that knowledge compilation will have to overcome first.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

References

  • [Barr & Feigenbaum 82] A. Barr, P.R. Cohen, and E.A. Feigenbaum (editors).Handbook of Artificial Intelligence. William Kaufmann, Inc., 1981–82

  • [Braudaway & Tong 89] W. Braudaway and C. Tong. Automated synthesis of constrained generators. InProceedings of the Eleventh International Joint Conference on Artificial Intelligence. Detroit, MI, August, 1989

  • [Dietterich 86a] T.G. Dietterich (editor).Proceedings of the Workshop on Knowledge Compilation. Oregon State University Department of Computer Science, 1986

  • [Dietterich 86b] T.G. Dietterich. Learning at the knowledge level.Machine Learning 1(3):287–315, 1986

    Google Scholar 

  • [Dietterich & Michalski 83] T.G. Dietterich and R.S. Michalski, A comparative review of selected methods for learning from examples. In R.S. Michalski, J.G. Carbonell, and T.M. Mitchell (editors),Machine Learning, pages 41–81. Palo Alto, CA: Tioga Publishing Company, 1983

    Google Scholar 

  • [Ellmann 88] T. Ellman. Approximate theory formation: An explanation-based approach. InProceedings of the Seventh National Conference on Artificial Intelligence (AAAI88), pages 570–574. St. Paul, MN, 1988

  • [Fawcett 88] T. Fawcett. A control strategy for heuristic search algorithm design. May, 1988. Rutgers AI/Design Working Paper Number 104

  • [Flemming 86] U. Flemming. On the representation and generation of looselypacked arrangements of rectangles.Environment and Planning B. Planning and Design 13:189–205, 1986

    Google Scholar 

  • [Kelly 88] K. Kelly, Router Derivation #1. May, 1988. Rutgers AI/Design Project Working Paper Number 103

  • [Laird et al 87] J.E. Laird, A. Newell, and P.S. Rosenbloom. Soar: An architecture for general intelligence.Artificial Intelligence 33(1), 1987

  • [Langrana et al 86] N. Langrana, T. Mitchell, and N. Ramachandran. Progress toward a knowledge-based aid for mechanical design. InProceedings of the Symposium on Integrated and Intelligent Manufacturing. ASME, Anaheim, California, 1986. 1986 ASME Winter Annual Meeting

    Google Scholar 

  • [Liew & Tong 87] C. Liew and C. Tong. Knowledge Compilation: A Prototype System and a Conceptual Framework. February, 1987. Rutgers AI/VLSI Project Working Paper No. 47

  • [Mitchell et al 85a] T.M. Mitchell, L.I. Steinberg, and J. Shulman. A knowledgebased approach to design.IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-7(5):502–510, September, 1985

    Google Scholar 

  • [Mitchell et al 85b] T.M. Mitchell, S. Madadevan, and L. Steinberg. LEAP: A learning apprentice for VLSI design. InProceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCA1985), pages 573–580. Los Angeles, CA, August, 1985

  • [Mitchell et al 86] T.M. Mitchell, R.M. Keller, and S.T. Kedar-Cabelli. Explanation-based generalization: A unifying view.Machine Learning 1(1):47–80, 1986

    Google Scholar 

  • [Mohan & Tong 89] S. Mohan and C. Tong. Automatic construction of hierarchical generate-and-test algorithms. InProceedings of the Sixth International Workshop on Machine Learning. June, 1989

  • [Mostow 81] J. Mostow.Mechanical Transformation of Task Heuristics into Operational Procedures. PhD Thesis, Carnegie-Mellon University, 1981. Technical Report CMU-CS-81-113. 499 pages

  • [Mostow 83a] D.J. Mostow. Learning by being told: Machine transformation of advice into a heuristic search procedure. In J.G. Carbonell, R.S. Michalski, and T.M. Mitchell (editors),Machine Learning, pages 367–403. Palo Alto, CA: Tioga, 1983

    Google Scholar 

  • [Mostow 83b] J. Mostow. Operationalizing advice: A problem-solving model. InProceedings of the Second International Machine Learning Workshop, pages 110–116. University of Illinois, June, 1983

  • [Mostow 83c] J. Mostow, A problem-solver for making advice operational. InProceedings of the Third National Conference on Artificial Intelligence (AAAI83), pages 279–283. American Association for Artificial Intelligence, Washington, DC, August, 1983

    Google Scholar 

  • [Mostow 85] J. Mostow. Toward better models of the design process.AI Magazine 6(1):44–57, Spring, 1985

    Google Scholar 

  • [Mostow 88] J. Mostow. A preliminary report on DIOGENES: Progress towards semi-automatic design of specialized heuristic search algorithms. InProceedings of the AAAI88 Workshop on Automated Software Design, pages 111–124. St. Paul, MN, August, 1988

  • [Mostow 89a] J. Mostow. Towards knowledge compilation as an approach to computer-aided design. InProceedings of the NSF Engineering Design Research Conference, pages 475–490. Amherst, MA, June, 1989. Available as Rutgers AI/Design Project Working Paper Number 120–2

  • [Mostow 89b] J. Mostow. An object-oriented representation for search algorithms. InProceedings of the Sixth International Workshop on Machine Learning. Morgan Kaufmann, Cornell University, Ithaca, NY, June, 1989

    Google Scholar 

  • [Mostow 89c] J. Mostow. Design by derivational analogy: Issues in the automated replay of design plans.Artificial Intelligence 40(1–3):119–186, September, 1989. In special volume on machine learning

    Google Scholar 

  • [Mostow & Bhatnagar 87] J. Mostow & N. Bhatnagar. Failsafe–a floor planner that uses EBG to learn from its failures. InProceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI87), pages 249–255. Morgan Kaufmann, Milan, Italy, August, 1987

    Google Scholar 

  • [Mostow & Fisher 89] J. Mostow and G. Fisher. Replaying transformational derivations of heuristic search algorithms in DIOGENES. InProceedings of the DARPA Workshop on Case-Based Reasoning, pages 94–99. Pensacola, FL, May, 1989

  • [Mostow & Prieditis 89] J. Mostow and A.E. Prieditis. Discovering admissible heuristics by abstracting and optimizing: A transformational approach. InProceedings of the Eleventh Joint International Conference on Artificial Intelligence. Detroit, MI, August, 1989. Available as Rutgers AI/Design Project Working Paper Number 114–1

  • [Mostow & Swartout 86] J. Mostow and W. Swartout. Towards explicit integration of knowledge in expert systems: An analysis of MYCIN's therapy selection algorithm. InProceedings of the Fifth National Conference on Artificial Intelligence (AAAI86), pages 928–935. Philadelphia, PA, August, 1986

  • [Mostow & Voigt 87] J. Mostow and K. Voigt. Explicit integration of multiple goals in heuristic algorithm design. InProceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI87), pages 1090–1096. Morgan Kaufmann, Milan, Italy, August, 1987

    Google Scholar 

  • [Mostow et al 89] J. Mostow, M. Barley, and T. Weinrich. Automated reuse of design plans.International Journal for Artificial Intelligence in Engineering, October, 1989, 4(4):181–196

    Google Scholar 

  • [Newell 82] A. Newell. The knowledge level.Artificial Intelligence (18):87–127, 1982

  • [Paige & Koenig 82] R. Paige and S. Koenig. Finite differencing of computable expressions.ACM Toplas 4(3):402–454, July, 1982

    Google Scholar 

  • [Prieditis 87] A. Prieditis. SPIKE: A State-Space Search Design System. Fall, 1987. Rutgers AI/Design Project Working Paper Number 77

  • [Reasoning Systems 87]REFINE TM User's Guide. Reasoning Systems, Inc., Palo Alto, CA, 1987

  • [Rosenbloom et al 85] P.S. Rosenbloom, J.E. Laird, J. McDermott, A. Newell, and E. Orciuch. R1-Soar: An experiment in knowledge-intensive programming in a problem-solving architecture.IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI7(5):561–569, September, 1985

    Google Scholar 

  • [Sacerdoti 74] E.D. Sacerdoti. Planning in a hierarchy of abstraction spaces.Artificial Intelligence 5:115–135, 1974

    Google Scholar 

  • [Savage 83] J.E. Savage. Three VLSI compilation techniques: PLA's, Weinberger arrays, and SLAP, a new silicon layout program. In L. Snyder, L.J. Seigel, H.J. Seigel, and D. Gannon (editors),Algorithmically-Specialized Computers. Academic Press, 1983

  • [Setliff 89] D. Setliff.Knowledge-Based Synthesis of Custom VLSI Physical Design Tools. PhD Thesis, Carnegie Mellon University, March, 1989

  • [Setliff & Rutenbar 88a] D. Setliff and R. Rutenbar. Knowledge-based synthesis of custom VLSI physical design tools: First steps. InProceedings of the Conference on Artificial Intelligence Applications. IEEE, March, 1988

  • [Setliff & Rutenbar 88b] D.E. Setliff and R.A. Rutenbar. Integrating domain knowledge and generic program synthesis knowledge: A case study of software synthesis for VLSI design tools. InProceedings of the AAAI88 Workshop on Automating Software Design, pages 165–171. St. Paul, MN, August, 1988

  • [Setliff & Rutenbar 89] D. Setliff and R. Rutenber. ELF: A tool for automatic synthesis of custom physical CAD software. InProceedings of the Design Automation Conference. IEEE, June, 1989

  • [Smith 82] D.R. Smith. Derived preconditions and their use in program synthesis. In D.W. Loveland (editor).Proceedings of the Sixth Conference on Automated Deduction, pages 172–193. Springer-Verlag, New York, 1982. Lecture Notes in Computer Science 138

    Google Scholar 

  • [Smith 87] D.R. Smith. On the design of generate-and-test algorithms: subspace generators. In L. Meertens (editor),Program Specification and Transformation, pages 207–220. North-Holland, Amsterdam, 1987. Technical Report KES.U.86.6, Kestrel Institute, September 1985

    Google Scholar 

  • [Smith 88a] D.R. Smith. KIDS: A knowledge-based software development system. InProceedings of the AAAI88 Workshop on Automated Software Design. American Association for Artificial Intelligence, St. Paul, MN, August, 1988

    Google Scholar 

  • [Smith 88b] D.R. Smith.Structure and Design of Global Search Algorithms. Technical Report KES.U.87.12, Kestrel Institute, 1801 Page Mill Road, Palo Alto, CA 94304, July, 1988

    Google Scholar 

  • [Steier & Newell 88] D. Steier and A. Newell. Integrating multiple sources of knowledge into Designer-Soar, an automatic algorithm designer. InProceedings of the National Conference on Artificial Intelligence, pages 8–13. AAAI, St. Paul, MN, August, 1988

  • [Steinberg 87a] L. Steinberg. Design = top down refinement plus constraint propagation plus what? InProceedings of the 1987 IEEE International Conference on Systems, Man, and Cybernetics, pages 498–502. Alexandria, VA, October, 1987. Available as Rutgers AI/VLSI Project Working Paper No. 67

  • [Steinberg 87b] L. Steinberg. Design as refinement plus constraint propagation: The VEXED experience. InProceedings of the Sixth National Conference on Artificial Intelligence (AAAI87), pages 830–835. Seattle, WA, July, 1987. Available as Rutgers AI/VLSI Project Working Paper No. 51

  • C. Tong. KBSDE: An environment for developing knowledge-based design tools. In T. Dietterich (editor),Proceedings of the Workshop on Knowledge Compilation, pages 127–138. Oregon State University, September, 1986

  • C. Tong. Floorplanning Term Project Description for CS530: Intermediate Artificial Intelligence. Rutgers AI/VLSI Project Working Paper No. 55

  • C. Tong.Knowledge-Based Circuit Design. PhD Thesis, Stanford University Computer Science Department, 1988

  • C. Tong and P. Franklin. Tuning a knowledge base of refinement rules to create good circuit designs. InProceedings of the Eleventh International Joint Conference on Artificial Intelligence. Detroit, MI, August, 1989

  • P.E. Utgoff and S. Saxena. Learning a preference predicate. InProceedings of the Fourth International Workshop on Machine Learning, pages 115–121. Morgan Kaufmann, Irvine, CA, June, 1987

    Google Scholar 

  • K. Voigt and C. Tong. Automating the construction of patchers that satisfy global constraints. InProceedings of the Eleventh International Joint Conference on Artificial Intelligence. Detroit, MI, August, 1989

  • C.-F. Yu and B.W. Wah. Learning dominance relations in combinatorial search problems.IEEE Transactions on Software Engineering 14(8):1155–1175, August, 1988

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mostow, J. Towards automated development of specialized algorithms for design synthesis: Knowledge compilation as an approach to computer-aided design. Research in Engineering Design 1, 167–186 (1990). https://doi.org/10.1007/BF01581210

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581210

Keywords

Navigation