Logical settings for concept-learning

DOI10.1016/S0004-3702(97)00041-6zbMath0894.68142MaRDI QIDQ1389603

Luc De Raedt

Publication date: 30 June 1998

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

zbMATH Keywords

computational learning theory; inductive logic programming; logic; concept-learning

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T27: Logic in artificial intelligence

68N17: Logic programming

Related Items

Probabilistic Inductive Logic Programming, Basic Principles of Learning Bayesian Logic Programs, Learning logic programs with structured background knowledge, Inductive equivalence in clausal logic and nonmonotonic logic programming, Relational information gain, ILP turns 20. Biography and future challenges, Inverse subsumption for complete explanatory induction, Theory revision with queries: Horn, read-once, and parity formulas, Towards refinement of abductive or inductive hypotheses through propagation, Margin-based first-order rule learning, Logical analysis of binary data with missing bits, Brave induction: a logical framework for learning from incomplete information, Complexity parameters for first order classes, Polynomial certificates for propositional classes, The subsumption lattice and query learning, Brave Induction

Uses Software

• GOLEM

Cites Work

• Clausal discovery
• Prediction-preserving reducibility
• Learning conjunctions of Horn clauses
• First-order \(jk\)-clausal theories are PAC-learnable
• A theory of the learnable
• Computational limitations on learning from examples
• Inductive Logic Programming: Theory and methods
• Pac-learning non-recursive Prolog clauses
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item