Learning higher-order logic programs
From MaRDI portal
Publication:2203320
DOI10.1007/s10994-019-05862-7OpenAlexW2992216954WikidataQ126590863 ScholiaQ126590863MaRDI QIDQ2203320
Andrew Cropper, Rolf Morel, Stephen H. Muggleton
Publication date: 6 October 2020
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.10953
Related Items (4)
Inductive logic programming at 30 ⋮ \(\alpha\)ILP: thinking visual scenes as differentiable logic programs ⋮ Making sense of sensory input ⋮ Learning programs by learning from failures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Completing causal networks by meta-level abduction
- ILP turns 20. Biography and future challenges
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
- Occam's razor
- Interactive concept-learning and constructive induction by analogy
- Top-down induction of first-order logical decision trees
- The appropriateness of predicate invention as bias shift operation in ILP
- Meta-interpretive learning: application to grammatical inference
- Typed meta-interpretive learning of logic programs
- Learning efficient logic programs
- Example-directed synthesis: a type-theoretic interpretation
- SWI-Prolog
- A Deductive Approach to Program Synthesis
- Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning
- A model building framework for answer set programming with external computations
- Inductive synthesis of recursive logic programs: achievements and prospects
- Derivation Reduction of Metarules in Meta-interpretive Learning
- Automating string processing in spreadsheets using input-output examples
This page was built for publication: Learning higher-order logic programs