Parallel Constraint-Driven Inductive Logic Programming
Not on the map. Why?
Abstract (arXiv)
Multi-core machines are ubiquitous. However, most inductive logic programming (ILP) approaches use only a single core, which severely limits their scalability. To address this limitation, we introduce parallel techniques based on constraint-driven ILP where the goal is to accumulate constraints to restrict the hypothesis space. Our experiments on two domains (program synthesis and inductive general game playing) show that (i) parallelisation can substantially reduce learning times, and (ii) worker communication (i.e. sharing constraints) is important for good performance.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 29 references that are in the map. First posted on arXiv 15 Sep 2021.
Builds on
7 of 29 references.
References · 7
- 2020Learning programs by learning from failurescited by 73
- 2014Clingo = ASP + Control: Preliminary Reportcited by 56
- 2021Inductive logic programming at 30cited by 46
- 2019Making sense of sensory inputcited by 29
- 2019Inductive general game playingcited by 18
- 2018Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learningcited by 12
- 2021Predicate Invention by Learning From Failurescited by 9
Built on by
Not cited yet.