Logical settings for concept-learning

DOI10.1016/S0004-3702(97)00041-6MaRDI QIDQ1389603zbMATH OpenOpenAlexFDO

Authors Luc De Raedt

Publication date 30 June 1998

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0004-3702(97)00041-6, https://lirias.kuleuven.be/handle/123456789/124972

zbMATH Keywords

computational learning theoryconcept-learninginductive logic programminglogic

Mathematics Subject Classification ID

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

Recommendations

• Logical aspects of learning concepts
• Logical and Relational Learning
• Logic and learning
• A dynamic logic for learning theory
• A dynamic logic for learning theory
• scientific article; zbMATH DE number 1568686

Cites work

• A theory of the learnable
• Clausal discovery
• Computational limitations on learning from examples
• First-order \(jk\)-clausal theories are PAC-learnable
• scientific article; zbMATH DE number 996385 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4053069 (Why is no real title available?)
• scientific article; zbMATH DE number 54155 (Why is no real title available?)
• scientific article; zbMATH DE number 2077169 (Why is no real title available?)
• scientific article; zbMATH DE number 877754 (Why is no real title available?)
• Inductive inference machines that can refute hypothesis spaces
• Inductive Logic Programming: Theory and methods
• Learning conjunctions of Horn clauses
• Pac-learning non-recursive Prolog clauses
• Prediction-preserving reducibility

Cited in

(25)

• Margin-based first-order rule learning
• Strategies in combined learning via logic programs
• Logical analysis of binary data with missing bits
• The complexity and generality of learning answer set programs
• Brave induction: a logical framework for learning from incomplete information
• Learning from interpretation transition
• Complexity parameters for first order classes
• Polynomial certificates for propositional classes
• The subsumption lattice and query learning
• A MINSAT approach for learning in logic domains
• Inductive learning of answer set programs
• Deductive learning
• Brave Induction
• Inductive equivalence in clausal logic and nonmonotonic logic programming
• Relational information gain
• A study of relevance for learning in deductive databases
• ILP turns 20. Biography and future challenges
• Inverse subsumption for complete explanatory induction
• Collaborative vs. Conflicting Learning, Evolution and Argumentation
• Probabilistic Inductive Logic Programming
• Basic Principles of Learning Bayesian Logic Programs
• Learning logic programs with structured background knowledge
• Theory revision with queries: Horn, read-once, and parity formulas
• Towards refinement of abductive or inductive hypotheses through propagation
• Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited

Describes a project that uses

Uses Software

• GOLEM

This page was built for publication: Logical settings for concept-learning

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