Pac-learning non-recursive Prolog clauses

DOI10.1016/0004-3702(94)00034-4OpenAlexW1979576691MaRDI QIDQ5925569

William W. Cohen

Publication date: 21 September 2022

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

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

zbMATH Keywords

inductive logic programmingmachine learningpac-learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)

Uses Software

• GOLEM

Cites Work

• Classic learning
• Prediction-preserving reducibility
• Learning conjunctions of Horn clauses
• Grammatically biased learning: Learning logic programs using an explicit antecedent description language
• On learning visual concepts and DNF formulae
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Computational limitations on learning from examples
• Learning Simple Concepts under Simple Distributions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pac-learning non-recursive Prolog clauses