Pac-learning non-recursive Prolog clauses

DOI10.1016/0004-3702(94)00034-4zbMath1013.68506OpenAlexW1979576691MaRDI QIDQ5917441

William W. Cohen

Publication date: 4 February 2003

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

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

Mathematics Subject Classification ID

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

Related Items

Logical settings for concept-learning, Learning logic programs with structured background knowledge, Pac-learning non-recursive Prolog clauses, Prediction-hardness of acyclic conjunctive queries, Mind change complexity of learning logic programs, The complexity of theory revision

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
• The learnability of description logics with equality constraints
• Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
• On learning visual concepts and DNF formulae
• Inductive Logic Programming: Issues, results and the challenge of Learning Language in Logic
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Computational limitations on learning from examples
• Learning Simple Concepts under Simple Distributions
• Cryptographic limitations on learning Boolean formulae and finite automata
• Pac-learning non-recursive Prolog clauses
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item