Paper Info
Title
Inductive Synthesis of Term Rewritin Systems
Abstract
Fast algorithm for inductive synthesis of term rewriting systems is described and proved to be correct. It is implemented and successfully applied for inductive synthesis of different algorithms, including the binary multiplication. The algorithm proposed supports automatic learning process and can be used for designing and implementation of ADT.
Year
DOI
Venue
1991
10.1007/BFb0019361
Baltic computer science
Keywords
Field
DocType
term rewritin systems,inductive synthesis
Abstract data type,Computer science,Theoretical computer science,Binary multiplication,Automatic learning,Rewriting
Conference
ISBN
Citations 
PageRank 
3-540-54131-4
3
0.55
References 
Authors
11
1
Name
Order
Citations
PageRank
Guntis Barzdins112118.62