Inductive inference of monotonic formal systems from positive data
From MaRDI portal
Publication:749217
DOI10.1007/BF03037094zbMATH Open0712.68062OpenAlexW2002663765MaRDI QIDQ749217FDOQ749217
Authors: Takeshi Shinohara 
Publication date: 1991
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03037094
Recommendations
- scientific article; zbMATH DE number 3982507
- Algorithmic Learning Theory
- scientific article; zbMATH DE number 996381
- Monotonic and non-monotonic inductive inference
- Monotonicity inference for higher-order formulas
- Monotonicity inference for higher-order formulas
- scientific article; zbMATH DE number 517031
- Mapping monotonic restrictions in inductive inference
- scientific article; zbMATH DE number 996380
Cites Work
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of Formal Systems. (AM-47)
- Alternation and the computational complexity of logic programs
- Title not available (Why is that?)
- ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
- Title not available (Why is that?)
Cited In (24)
- On a generalized notion of mistake bounds
- Learning power and language expressiveness.
- Identification through Inductive Verification
- The synthesis of language learners.
- Developments from enquiries into the learnability of the pattern languages from positive data
- Learning of erasing primitive formal systems from positive examples
- Title not available (Why is that?)
- Mind change efficient learning
- From learning in the limit to stochastic finite learning
- \(K\)-valued non-associative Lambek grammars are learnable from function-argument structures
- Title not available (Why is that?)
- Refuting learning revisited.
- Rich classes inferable from positive data: Length-bounded elementary formal systems
- Title not available (Why is that?)
- Synthesizing learners tolerating computable noisy data
- Mind change optimal learning of Bayes net structure from dependency and independency data
- Inductive inference of unbounded unions of pattern languages from positive data
- Some classes of term rewriting systems inferable from positive data
- Mapping monotonic restrictions in inductive inference
- Mind change complexity of learning logic programs
- Some classes of Prolog programs inferable from positive data
- Advanced elementary formal systems.
- Hypothesis finding with proof theoretical appropriateness criteria
- Incremental concept learning for bounded data mining.
This page was built for publication: Inductive inference of monotonic formal systems from positive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749217)
