Inductive inference of monotonic formal systems from positive data

DOI10.1007/BF03037094zbMath0712.68062OpenAlexW2002663765MaRDI QIDQ749217

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

zbMATH Keywords

monotonicitylogic programsformal languagesinductive inferenceformal systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability and inductive logic (03B48)

Related Items

Advanced elementary formal systems. ⋮ Refuting learning revisited. ⋮ Learning power and language expressiveness. ⋮ From learning in the limit to stochastic finite learning ⋮ Learning of erasing primitive formal systems from positive examples ⋮ Some classes of term rewriting systems inferable from positive data ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures ⋮ Synthesizing learners tolerating computable noisy data ⋮ Mind change efficient learning ⋮ Inductive inference of unbounded unions of pattern languages from positive data ⋮ Some classes of Prolog programs inferable from positive data ⋮ Mind change optimal learning of Bayes net structure from dependency and independency data ⋮ The synthesis of language learners. ⋮ Incremental concept learning for bounded data mining. ⋮ On a generalized notion of mistake bounds ⋮ Mind change complexity of learning logic programs ⋮ Hypothesis finding with proof theoretical appropriateness criteria

Cites Work

• Theory of Formal Systems. (AM-47)
• Alternation and the computational complexity of logic programs
• Inductive inference of formal languages from positive data
• ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item