Inductive inference of term rewriting systems from positive data

DOI10.1007/978-3-540-30215-5_7MaRDI QIDQ5464524zbMATH OpenOpenAlexFDO

Authors M. R. K. Krishna Rao

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100989

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Recommendations

• Some classes of term rewriting systems inferable from positive data
• Some classes of Prolog programs inferable from positive data
• A class of Prolog programs inferable from positive data
• Algorithmic Learning Theory
• scientific article; zbMATH DE number 3982507

Cited in

(11)

• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Modular proofs for completeness of hierarchical term rewriting systems
• Some classes of Prolog programs inferable from positive data
• LARS: a learning algorithm for rewriting systems
• scientific article; zbMATH DE number 996381 (Why is no real title available?)
• A class of Prolog programs inferable from positive data
• Algorithmic Learning Theory
• Inductive inference of unbounded unions of pattern languages from positive data
• Inductive inference of monotonic formal systems from positive data
• Some classes of term rewriting systems inferable from positive data
• Developments from enquiries into the learnability of the pattern languages from positive data

This page was built for publication: Inductive inference of term rewriting systems from positive data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464524)