Mind change complexity of learning logic programs

DOI10.1016/S0304-3975(01)00084-6zbMath0997.68064MaRDI QIDQ1603595

Sanjay Jain, Arun Sharma

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

computational learning theory; logic programs; inductive inference; mind change complexity

Mathematics Subject Classification ID

68Q32: Computational learning theory

68N17: Logic programming

Related Items

Mind change optimal learning of Bayes net structure from dependency and independency data, Generalized notions of mind change complexity, On the data consumption benefits of accepting increased uncertainty, Mind change efficient learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Elementary formal systems, intrinsic complexity, and procrastination
• Inductive inference of monotonic formal systems from positive data
• Finding patterns common to a set of strings
• Learning elementary formal systems
• On the role of procrastination in machine learning
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• First-order \(jk\)-clausal theories are PAC-learnable
• Foundations of inductive logic programming
• Generalized notions of mind change complexity
• A class of prolog programs inferable from positive data
• Inductive inference of formal languages from positive data
• Inductive Logic Programming: Theory and methods
• General inductive inference types based on linearly-ordered sets
• ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
• Monadic Elementary Formal Systems
• Language identification in the limit
• Pac-learning non-recursive Prolog clauses