Learning higher-order logic programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 1911272 (Why is no real title available?)
- A Deductive Approach to Program Synthesis
- A model building framework for answer set programming with external computations
- Automating string processing in spreadsheets using input-output examples
- Completing causal networks by meta-level abduction
- Derivation reduction of metarules in meta-interpretive learning
- Example-directed synthesis: a type-theoretic interpretation
- Exploiting answer set programming with external sources for meta-interpretive learning
- ILP turns 20. Biography and future challenges
- Inductive synthesis of recursive logic programs: achievements and prospects
- Interactive concept-learning and constructive induction by analogy
- Learning efficient logic programs
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
- Meta-interpretive learning: application to grammatical inference
- Occam's razor
- SWI-Prolog
- The appropriateness of predicate invention as bias shift operation in ILP
- Top-down induction of first-order logical decision trees
- Typed meta-interpretive learning of logic programs
Cited in
(19)- Inductive logic programming at 30
- Making sense of sensory input
- Learning efficient logic programs
- A differentiable first-order rule learner for inductive logic programming
- Machine learning of higher-order programs
- Higher-order logic learning and Progol
- \(\alpha\)ILP: thinking visual scenes as differentiable logic programs
- Learning programs with magic values
- First-Order Logical Neural Networks
- Can HOLL outperform FOLL?
- Nominal anti-unification modulo equational theories
- Equational generalization problems with atom-variables
- Learning programs by learning from failures
- Reinforcement learning for Golog programs with first-order state-abstraction
- A nominal approach to equational problems in languages with binders
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
- Integrating multiple learning strategies in first order logics
- A framework for incremental learning of logic programs
- Ultra-strong machine learning: comprehensibility of programs learned with ILP
This page was built for publication: Learning higher-order logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2203320)
