Learning languages from positive data and negative counterexamples

DOI10.1016/j.jcss.2007.06.012zbMath1146.68382OpenAlexW2159057822WikidataQ124807020 ScholiaQ124807020MaRDI QIDQ927865

Sanjay Jain, E. B. Kinber

Publication date: 10 June 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2007.06.012

zbMATH Keywords

computational learning theoryinductive inferencelearning in the limitnegative counterexamples

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (6)

Learning from Positive Data and Negative Counterexamples: A Survey ⋮ Intrinsic complexity of partial learning ⋮ Iterative learning from texts and counterexamples using additional information ⋮ Automatic learning from positive data and negative counterexamples ⋮ One-shot learners using negative counterexamples and nearest positive examples ⋮ Iterative Learning from Texts and Counterexamples Using Additional Information

Cites Work

• Comparison of identification criteria for machine inductive inference
• Inductive inference from all positive and some negative data
• Extremes in the degrees of inferability
• Language learning with some negative information
• Queries and concept learning
• Toward a mathematical theory of inductive inference
• Characterization of language learning front informant under various monotonicity constraints
• Learning Theory
• Algorithmic Learning Theory
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning languages from positive data and negative counterexamples