Abstract
In this paper, we consider the problem of synthesizing certain type of flowcharts, called process flowcharts. A process flowchart is a flowchart which describes a process of some routine work such as a procedure of creating executable programs. Our synthesis algorithm gets information on a process flowchart through interactions with the user; the algorithm successively predicts a statement and the user examine whether the prediction is exactly what the user expects or not and, if necessary, the user provides the algorithm with counterexamples. Our algorithm identifies a subclass of process flowcharts, called the class of historically deterministic process flowcharts, in the limit. It creates any conjecture in a polynomial time of the size of input examples.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin. Learning regular sets from queries and counter-examples. Information and Computation, 75:87–106, 1987.
J. Barzdin. On synthesizing programs given by examples. In A. P. Ershov and V. A. Nepommiaschy, editors, International Symposium on Theoretical Programming, Lecture Notes in Computer Science, No.5, pages 56–63. Springer-Verlag, 1974.
A. P. Ershov. Theory of program schemata. In Proceedings of IFIP Congress 71, pages 28–45, 1971.
J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Massachusetts, 1979.
L. Pitt. Inductive inference, dfas, and computational complexity. In K. P. Jantke, editor, Proceedings of 2nd Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence, 397, pages 18–44. Springer-Verlag, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takada, Y. (1993). Interactive synthesis of process flowcharts. In: Brewka, G., Jantke, K.P., Schmitt, P.H. (eds) Nonmonotonic and Inductive Logic. NIL 1991. Lecture Notes in Computer Science, vol 659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030400
Download citation
DOI: https://doi.org/10.1007/BFb0030400
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56433-1
Online ISBN: 978-3-540-47557-6
eBook Packages: Springer Book Archive