Inductive synthesis of term rewriting systems
From MaRDI portal
Publication:4560356
DOI10.1007/BFb0019361zbMath1412.68290OpenAlexW1501813452MaRDI QIDQ4560356
Publication date: 11 December 2018
Published in: Baltic Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0019361
Computational learning theory (68Q32) Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42) General topics in the theory of algorithms (68W01)
Cites Work
- Termination of rewriting
- Finding patterns common to a set of strings
- Rapid construction of algebraic axioms from samples
- Generalized regular expressions - a language for synthesis of programs with branching in loops
- A Methodology for LISP Program Construction from Examples
- Constructing Programs from Example Computations
- The Inference of Regular LISP Programs from Examples
- Language identification in the limit
- Unnamed Item
This page was built for publication: Inductive synthesis of term rewriting systems