Automatic learning from positive data and negative counterexamples
DOI10.1016/J.IC.2017.05.002zbMATH Open1377.68096OpenAlexW4249441655WikidataQ124792156 ScholiaQ124792156MaRDI QIDQ2013555FDOQ2013555
Authors: Sanjay Jain, Frank Stephan, Efim Kinber 
Publication date: 8 August 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2017.05.002
Recommendations
- Automatic learning from positive data and negative counterexamples
- Learning from Positive Data and Negative Counterexamples: A Survey
- Algorithmic Learning Theory
- Learning languages from positive data and negative counterexamples
- Learning languages from positive data and a limited number of short counterexamples
Computational learning theory (68Q32) Algebraic theory of languages and automata (68Q70) Descriptive complexity and finite models (68Q19)
Cites Work
- Queries and concept learning
- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
- Title not available (Why is that?)
- Inductive inference of formal languages from positive data
- Title not available (Why is that?)
- Toward a mathematical theory of inductive inference
- Title not available (Why is that?)
- Title not available (Why is that?)
- Language identification in the limit
- Monotonic and non-monotonic inductive inference
- Finding patterns common to a set of strings
- Learning elementary formal systems
- Rich classes inferable from positive data: Length-bounded elementary formal systems
- Learnability of automatic classes
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Distributional learning of parallel multiple context-free grammars
- Relations between Gold-style learning and query learning
- Towards General Algorithms for Grammatical Inference
- On the impact of forgetting on learning machines
- Title not available (Why is that?)
- Closed choice and a uniform low basis theorem
- Iterative learning from positive data and negative counterexamples
- Learning languages from positive data and negative counterexamples
- Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
- Even linear simple matrix languages: formal language properties and grammatical inference.
- A machine discovery from amino acid sequences by decision trees over regular patterns
- ON AUTOMATIC FAMILIES
- Independence Results for n-Ary Recursion Theorems
- Learning via queries in [+, <]
- Polynomial inference of universal automata from membership and equivalence queries
- Learning recursive languages from good examples
- Learning erasing pattern languages with queries
- Learning regular languages from counterexamples
- Title not available (Why is that?)
- Automatic Learning from Positive Data and Negative Counterexamples
- A theory of formal synthesis via inductive learning
- Title not available (Why is that?)
- Probabilistic computability and choice
- Automatic functions, linear time and learning
- Characteristics of Minimal Effective Programming Systems
Cited In (4)
This page was built for publication: Automatic learning from positive data and negative counterexamples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013555)
