First-order \(jk\)-clausal theories are PAC-learnable

DOI10.1016/0004-3702(94)90112-0zbMath0938.68773MaRDI QIDQ1342231

Sašo Džeroski, Luc De Raedt

Publication date: 21 June 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(94)90112-0

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68Q45: Formal languages and automata

Related Items

Probabilistic Inductive Logic Programming, Learning logic programs with structured background knowledge, Top-down induction of first-order logical decision trees, Logical settings for concept-learning, Mind change complexity of learning logic programs, Complexity parameters for first order classes, Polynomial certificates for propositional classes, Prediction-hardness of acyclic conjunctive queries, Foundations of Onto-Relational Learning, Inductive Logic Programming in Databases: From <scp>Datalog</scp> to

Uses Software

• GOLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flattening and saturation: Two representation changes for generalization
• Grammatically biased learning: Learning logic programs using an explicit antecedent description language
• Probably Approximate Learning of Sets and Functions
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Inductive Logic Programming: Theory and methods