Inductive inference of monotonic formal systems from positive data

DOI10.1007/BF03037094MaRDI QIDQ749217zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

monotonicityformal languagesinductive inferenceformal systemslogic programs

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 3817068 (Why is no real title available?)
• scientific article; zbMATH DE number 3982507 (Why is no real title available?)
• scientific article; zbMATH DE number 67628 (Why is no real title available?)
• scientific article; zbMATH DE number 67629 (Why is no real title available?)
• scientific article; zbMATH DE number 3806956 (Why is no real title available?)
• Alternation and the computational complexity of logic programs
• ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Theory of Formal Systems. (AM-47)

Cited in

(24)

• On a generalized notion of mistake bounds
• Learning power and language expressiveness.
• The synthesis of language learners.
• Identification through Inductive Verification
• Developments from enquiries into the learnability of the pattern languages from positive data
• Learning of erasing primitive formal systems from positive examples
• scientific article; zbMATH DE number 3982507 (Why is no real title available?)
• Mind change efficient learning
• From learning in the limit to stochastic finite learning
• scientific article; zbMATH DE number 517031 (Why is no real title available?)
• \(K\)-valued non-associative Lambek grammars are learnable from function-argument structures
• Refuting learning revisited.
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• scientific article; zbMATH DE number 3956468 (Why is no real title available?)
• Mind change optimal learning of Bayes net structure from dependency and independency data
• Synthesizing learners tolerating computable noisy data
• Some classes of term rewriting systems inferable from positive data
• Inductive inference of unbounded unions of pattern languages 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
• Hypothesis finding with proof theoretical appropriateness criteria
• Advanced elementary formal systems.
• 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)