Program synthesis from examples by theory formation

1. M. Aigner. Selecting the top three elements. Discrete Applied Mathematics, 4:247–267, 1982.

   Google Scholar 

2. W. Bibel. Syntax-directed, semantics supported program synthesis. Artificial Intelligence, 14:243–261, 1980.

   Google Scholar 

3. W. Biermann. Fundamental mechanisms in machine learning and inductive inference. In W. Bibel and Ph. Jorrand, editors, Fundamentals of Artificial Intelligence, pages 171–220. Springer Verlag (LNCS 232), 1987.

   Google Scholar 

4. S.L. Epstein and N.S. Sridharan. Knowledge representation for mathematical discovery: Three experiments in graph theory. J. of Applied Intelligence, 1(1):7–32, 1991.

   Google Scholar 

5. J. Eusterbrock. Errata to “Selecting the top three elements” by M. Aigner: A Result of a computer assisted proof search. Discrete Applied Mathematics, 41:131–137, 1992.

   Google Scholar 

6. J. Eusterbrock. Wissensbasierte Verfahren zur Synthese mathematischer Beweise: Eine kombinatorische Anwendung, volume 10 of DISKI. INFIX, 1992.

   Google Scholar 

7. J. Eusterbrock. A multi-layer architecture for knowledge-based system synthesis. In Proc. ISMIS, pages 582–592. Springer Verlag, 1996.

   Google Scholar 

8. J. Eusterbrock. Canonical term representations of isomorphic transitive dags for efficient knowledge-based reasoning. To appear in Proc. KRUSE'97, 1997.

   Google Scholar 

9. J. Eusterbrock and M. Nicolaides. The visualization of constructive proofs by compositional graph layout: A world-wide web interface. Proc. CADE Visual Reasoning Workshop, Rutgers University, 1996.

   Google Scholar 

10. Pierre Flener. Logic Program Synthesis from Incomplete Information. Kluwer Academic Publishers, 1995.

    Google Scholar 

11. W. Gasarch, W. Kelly, and W. Pugh. Finding the i-th largest of n for small i,n. Sigact News, 27(2):88–96, 1996.

    Google Scholar 

12. P. Gray and et al. KRAFT: Knowledge fusion from distributed databases and knowledge bases. In R. Wagner, editor, Proc. Int'l Workshop on Databases and Expert Systems, page to appear, 1997.

    Google Scholar 

13. M. Heissel, T. Santen, and D. Zimmermann. A generic system architecture for strategy-based software development. Technical report, Technische Universität Berlin, 8 1995.

    Google Scholar 

14. Chr. Kreitz. The representation of program synthesis in higher order logic. In H. Marburger, editor, GWAI-90, 14th German Workshop on Artificial Intelligence, pages 171–180. Springer Verlag, 1990.

    Google Scholar 

15. M. Lowry and J. Van Baalen. Meta-Amphion: Synthesis of efficient domain-specific program synthesis systems. Automated Software Engineering, 4(2):199–242, 1997.

    Google Scholar 

16. M.R. Lowry. Algorithm Synthesis through Problem Reformulation. PhD thesis, Stanford University, 1989.

    Google Scholar 

17. McCartney. Synthesizing algorithms with performance constraints. In Proc. AAAI-87, Sixth Nat. Conf. on Artificial Intelligence, volume 2, pages 149–154. Am. Ass. for Art. Int., 1987.

    Google Scholar 

18. B. Meltzer. Proof, abstraction and semantics in mathematics and artificial intelligence. In A. Marzollo, editor, Topics in Artificial Intelligence, pages 2–9. Springer Verlag, Wien New York, 1979.

    Google Scholar 

19. E.Y. Shapiro. Algorithmic Program Debugging. ACM Distinguished Dissertations, The MIT Press, 1982.

    Google Scholar 

20. D.R. Smith. Top-down synthesis of divide-and-conquer algorithms. Artificial Intelligence, 27:43–96, 1985.

    Google Scholar 

21. D.R. Smith. Constructing specification morphisms. Journal Symbolic Computation, 15:571–606, 1993.

    Google Scholar 

22. P.D. Summers. A methodology for lisp program construction from examples. Journal of the Association for Computing Machinery, 24(1):161–175, 1977.

    Google Scholar 

Download references