Mind change complexity of learning logic programs

DOI10.1016/S0304-3975(01)00084-6MaRDI QIDQ1603595zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Arun Sharma

Publication date 15 July 2002

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

Full work available at URL https://doi.org/10.1016/s0304-3975(01)00084-6, http://scholarbank.nus.edu.sg/handle/10635/39937

zbMATH Keywords

computational learning theoryinductive inferencelogic programsmind change complexity

Mathematics Subject Classification ID

Logic programming (68N17) Computational learning theory (68Q32)

Recommendations

• Calculating the mind change complexity of learning algebraic structures
• The complexity of revising logic programs
• Generalized notions of mind change complexity
• INDUCTIVE INFERENCE OF LIMITING PROGRAMS WITH BOUNDED NUMBER OF MIND CHANGES
• Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
• Alternation and the computational complexity of logic programs
• Learning efficient logic programs
• scientific article; zbMATH DE number 2084427
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• scientific article; zbMATH DE number 4130360

Cites work

• A class of Prolog programs inferable from positive data
• Comparison of identification criteria for machine inductive inference
• ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
• Elementary formal systems, intrinsic complexity, and procrastination
• Finding patterns common to a set of strings
• First-order \(jk\)-clausal theories are PAC-learnable
• Foundations of inductive logic programming
• General inductive inference types based on linearly-ordered sets
• Generalized notions of mind change complexity
• Generalized unification as background knowledge in lerning logic programs
• Higher recursion theory
• scientific article; zbMATH DE number 996385 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 67629 (Why is no real title available?)
• scientific article; zbMATH DE number 408771 (Why is no real title available?)
• scientific article; zbMATH DE number 1149414 (Why is no real title available?)
• scientific article; zbMATH DE number 1149415 (Why is no real title available?)
• scientific article; zbMATH DE number 784360 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Inductive inference of monotonic formal systems from positive data
• Inductive Logic Programming: Theory and methods
• Language identification in the limit
• Learning elementary formal systems
• Monadic Elementary Formal Systems
• On the role of procrastination in machine learning
• Pac-learning non-recursive Prolog clauses
• Rich classes inferable from positive data: Length-bounded elementary formal systems

Cited in

(8)

• Mind change optimal learning of Bayes net structure from dependency and independency data
• Ordinal mind change complexity of language identification
• Generalized notions of mind change complexity
• On the data consumption benefits of accepting increased uncertainty
• Mind change efficient learning
• Game semantics and the geometry of backtracking: a new complexity analysis of interaction
• Probabilistic and pluralistic learners with mind changes
• Elementary formal systems, intrinsic complexity, and procrastination

This page was built for publication: Mind change complexity of learning logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603595)