More about learning elementary formal systems
Starting from \textit{R. M. Smullyan} (1961) elementary formal systems (EFSs), the authors defined (1989) the class of variable-bounded EFSs as a unifying framework for language learning. The present paper investigates learning EFSs by using strategies like Shapiro's model inferences, inductive inference from positive data, and Valiant's probably approximately correct learning approach. A relationship between Chomsky hierarchy and EFS languages is outlined, and application to learning a molecular biology language is exposed. For the entire collection see [Zbl 0819.68110].
- Learning elementary formal systems
- A framework for incremental learning of logic programs
- Some classes of Prolog programs inferable from positive data
- Mind change complexity of learning logic programs
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- On a generalized notion of mistake bounds
- Learning elementary formal systems with queries.
- Advanced elementary formal systems.
- Automatic learning from positive data and negative counterexamples
- scientific article; zbMATH DE number 996385 (Why is no real title available?)
- scientific article; zbMATH DE number 67628 (Why is no real title available?)
- Extending elementary formal systems
- scientific article; zbMATH DE number 975708 (Why is no real title available?)
- Learning languages generated by elementary formal systems and its application to SH languages
- Incremental learning of logic programs
This page was built for publication: More about learning elementary formal systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202913)