Top program construction and reduction for polynomial time meta-interpretive learning
From MaRDI portal
Publication:2051277
Recommendations
- Typed meta-interpretive learning of logic programs
- Derivation reduction of metarules in meta-interpretive learning
- Meta-Interpretive Learning: Achievements and Challenges (Invited Paper)
- Ultra-strong machine learning: comprehensibility of programs learned with ILP
- Meta-interpretive learning: application to grammatical inference
- Meta-interpretive learning as metarule specialisation
- Exploiting answer set programming with external sources for meta-interpretive learning
Cites work
- A theory of the learnable
- Derivation reduction of metarules in meta-interpretive learning
- Exploiting answer set programming with external sources for meta-interpretive learning
- Foundations of inductive logic programming
- scientific article; zbMATH DE number 1256672 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- scientific article; zbMATH DE number 3412190 (Why is no real title available?)
- Inductive learning of answer set programs
- Inductive logic programming
- Inductive logic programming as abductive search
- Inductive synthesis of recursive logic programs: achievements and prospects
- Learning explanatory rules from noisy data
- Learning through hypothesis refinement using answer set programming
- Logic program synthesis from incomplete specifications
- Meta-interpretive learning from noisy images
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
- Meta-interpretive learning: application to grammatical inference
- Occam's razor
- TopLog: ILP Using a Logic Program Declarative Bias
- Typed meta-interpretive learning of logic programs
Cited in
(3)
This page was built for publication: Top program construction and reduction for polynomial time meta-interpretive learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051277)