Inferring flow of control in program synthesis by example

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1701, Issue , 1999, Pages 171-182

  Schrödl, Stefan ^a   Edelkamp, Stefan ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH LEVEL LANGUAGES; LEARNING SYSTEMS;

CONTROL STRUCTURE; DETERMINISTIC FINITE AUTOMATA; FLOW OF CONTROL; HIGH-LEVEL PROGRAMMING LANGUAGE; INTERACTIVE LEARNING; MEMBERSHIP QUERY; PROGRAM SYNTHESIS; TWO-STAGE PROCESS;

ARTIFICIAL INTELLIGENCE;

EID: 84947943937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48238-5_14     Document Type: Conference Paper

References (13)

1. A. V. Aho, J. E. Hopcroft, and J. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974.
2. D. Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51(1):76-87, 1981.
3. D. Angluin. Inferrence of reversible languages. Journal of the Association of Computing Machinery, 29:741-765, 1982.
4. A. W. Biermann. The inference of regular lisp programs from examples. IEEE Trans. on Systems, Man, and Cybernetics, 8(8):585-600, 1978.
5. A. Cypher, editor. Watch What I Do: Programming by Demonstration. MIT Press, 1993.
6. P. Flener. Logic Program Synthesis from Incomplete Information. Kluwer Academic Publishers, 1995.
7. B. Gaines. Behaviour/structure transformations under uncertainty. International Journal of Man-Machine Studies, 8(3):337-365, 1976.
8. E. M. Gold. Language identification in the limit. Information and Control, 10(5):447-474, 1967.
9. E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37(3):302-320, 1978.
10. D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley Publishing Company, Reading, 1973.
11. R. Parekh, C. Nichitiu, and V. Honovar. A polynomial time incremental algorithm for regular grammar inference. Technical Report 97-03, Department of computer science, Iowa State University, 1997.
12. J. C. Schlimmer and L. A. Hermens. Software agents: Completing patterns and constructing user interfaces. Journal of Artificial Intelligence Research, 1:61-89, 1993.
13. E. Y. Shapiro. Algorithmic Program Debuggging. PhD thesis, Yale University, 1983. Published under the same title by MIT press.