Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited

DOI10.1007/s10994-014-5471-yzbMath1346.68119OpenAlexW1769664091WikidataQ29399520 ScholiaQ29399520MaRDI QIDQ894695

Dianhuan Lin, Alireza Tamaddoni-Nezhad, Stephen H. Muggleton

Publication date: 2 December 2015

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-014-5471-y

zbMATH Keywords

inductionabductionpredicate inventionlearning recursionmeta-interpretation

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)

Related Items (21)

Inductive logic programming at 30 ⋮ Meta-interpretive learning from noisy images ⋮ Ultra-strong machine learning: comprehensibility of programs learned with ILP ⋮ Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition ⋮ Unnamed Item ⋮ Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning ⋮ Learning Through Hypothesis Refinement Using Answer Set Programming ⋮ FFNSL: Feed-forward neural-symbolic learner ⋮ Learning efficient logic programs ⋮ Relational data factorization ⋮ Learning higher-order logic programs ⋮ Logical reduction of metarules ⋮ Inductive general game playing ⋮ A comparative study of three neural-symbolic approaches to inductive logic programming ⋮ A neural cognitive model of argumentation with application to legal inference and decision making ⋮ Making sense of sensory input ⋮ Top program construction and reduction for polynomial time meta-interpretive learning ⋮ Learning programs by learning from failures ⋮ On cognitive preferences and the plausibility of rule-based models ⋮ Meta-interpretive learning as metarule specialisation ⋮ Nonground Abductive Logic Programming with Probabilistic Integrity Constraints

Uses Software

• Aleph
• Datalog
• Metagol

Cites Work

• ILP turns 20. Biography and future challenges
• A unification algorithm for typed \(\bar\lambda\)-calculus
• Grammatically biased learning: Learning logic programs using an explicit antecedent description language
• Foundations of inductive logic programming
• Logical settings for concept-learning
• Meta-interpretive learning: application to grammatical inference
• MetaBayes: Bayesian Meta-Interpretative Learning Using Higher-Order Stochastic Refinement
• Learnability and the Vapnik-Chervonenkis dimension
• Discovering Rules by Meta-level Abduction
• A theory of the learnable
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• Horn clause computability
• Inductive Logic Programming: Theory and methods
• Automated Deduction – CADE-20
• Inductive Logic Programming
• Relational reinforcement learning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited