Top program construction and reduction for polynomial time meta-interpretive learning

DOI10.1007/s10994-020-05945-wOpenAlexW3119214637MaRDI QIDQ2051277

S. Patsantzis, Stephen H. Muggleton

Publication date: 24 November 2021

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

Full work available at URL: https://arxiv.org/abs/2101.05050

zbMATH Keywords

inductive logic programmingmachine learningmeta interpretive learningtop program construction

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Inductive logic programming at 30 ⋮ Meta-interpretive learning as metarule specialisation

Uses Software

• TopLog
• GitHub
• Metagol
• Louise

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
• Occam's razor
• Logic program synthesis from incomplete specifications
• Foundations of inductive logic programming
• Meta-interpretive learning from noisy images
• Meta-interpretive learning: application to grammatical inference
• Typed meta-interpretive learning of logic programs
• INDUCTIVE LOGIC PROGRAMMING AS ABDUCTIVE SEARCH
• Inductive Learning of Answer Set Programs
• Learning Through Hypothesis Refinement Using Answer Set Programming
• A theory of the learnable
• Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning
• Learning Explanatory Rules from Noisy Data
• Inductive synthesis of recursive logic programs: achievements and prospects
• Derivation Reduction of Metarules in Meta-interpretive Learning
• TopLog: ILP Using a Logic Program Declarative Bias
• Inductive logic programming