Abstract
It is rather unrealistic to expect newly designed software specifications to be always complete. Naturally, there are several forms of incompleteness. We are not concerned with explicitly known incompleteness during an unfinished design process. Instead, the present approach is focussed on specifications which are either a little incomplete by mistake or intentionally incomplete as descriptions by examples are. Completing given specifications to an operationally complete form may be understood as program synthesis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin and C.H. Smith, Inductive Inference: Theory and Methods, Computing Surveys 15(3), 1983, 237–269.
H. Ehrig and B. Mahr, Fundamentals of Algebraic Specifications 1, EATCS Monographs on Theoretical Computer Science 6, Springer-Verlag, 1985.
E. M. Gold, Language Identification in the Limit. Inform, and Control 14, 1967, 447–474.
M. Hermann, Chain Properties of Rule Closures, Proc. 6th STACS, Paderborn, 1989, Springer-Verlag, Lecture Notes in Computer Science 349, 1989, 339–347.
G. Huet and D. Oppen, Equations and Rewrite Rules: a Survey, in R. Book (ed), Formal Language Theory: Perspectives and Open Problems, Academic Press, New York, 1980, 349–405.
K.P. Jantke, Algorithmic Learning from Incomplete Information: Principles and Problems, in J. Dassow and J. Kelemen (eds), Machines, Languages, and Complexity, Lecture Notes in Computer Science 381, Springer-Verlag, 1989, 188-207.
R. Klette and R. Wiehagen, Research in the Theory of Inductive Inference by GDR Mathematicians — A Survey, Inform. Sciences 22, 1980, 149–169.
D.E. Knuth and P.B. Bendix, Simple Word Problems in Universal Algebra, in J. Leach (ed), Computational Algebra, Pergamon Press, 1970, 263-297.
S. Lange, Towards a Set of Inference Rules for Solving Divergence in Knuth-Bendix Completion, in Proc. All’89, Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence 397, Springer-Verlag, 1989, 304-316.
S. Lange and K.P. Jantke, Inductive Completion for Transformation of Equational Specifications, in Proc. Recent Trends in Abstract Data Type Specification, Lecture Notes in Computer Science 534, Springer-Verlag, 1991.
M. Thomas and K.P. Jantke, Inductive Inference for Solving Divergence in Knuth-Bendix Completion, in Proc. AII’89, Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence 397, Springer-Verlag, 1989, 288-303.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Jantke, K.P., Goldammer, U. (1992). Inductive Synthesis of Rewrite Rules as Program Synthesis. In: Clement, T.P., Lau, KK. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3494-7_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3494-7_5
Publisher Name: Springer, London
Print ISBN: 978-3-540-19742-3
Online ISBN: 978-1-4471-3494-7
eBook Packages: Springer Book Archive