Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning

Meta-Interpretive Learning (MIL) learns logic programs from examples by instantiating meta-rules, which is implemented by the Metagol system based on Prolog. Viewing MIL-problems as combinatorial search problems, they can alternatively be solved by employing Answer Set Programming (ASP), which may result in performance gains as a result of efficient conflict propagation. However, a straightforward ASP-encoding of MIL results in a huge search space due to a lack of procedural bias and the need for grounding. To address these challenging issues, we encode MIL in the HEX-formalism, which is an extension of ASP that allows us to outsource the background knowledge, and we restrict the search space to compensate for a procedural bias in ASP. This way, the import of constants from the background knowledge can for a given type of meta-rules be limited to relevant ones. Moreover, by abstracting from term manipulations in the encoding and by exploiting the HEX interface mechanism, the import of such constants can be entirely avoided in order to mitigate the grounding bottleneck. An experimental evaluation shows promising results. Note: This paper is under consideration for acceptance in TPLP.

[1]  Stephen Muggleton,et al.  Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited , 2013, Machine Learning.

[2]  Stephen Muggleton,et al.  Bias reformulation for one-shot function induction , 2014, ECAI.

[3]  Martin Gebser,et al.  Conflict-driven answer set solving: From theory to practice , 2012, Artif. Intell..

[4]  Ryszard S. Michalski,et al.  Inductive inference of VL decision rules , 1977, SGAR.

[5]  Stephen Muggleton,et al.  Learning Higher-Order Logic Programs through Abstraction and Invention , 2016, IJCAI.

[6]  Stephen Muggleton,et al.  Meta-Interpretive Learning of Data Transformation Programs , 2015, ILP.

[7]  Krysia Broda,et al.  Inductive Learning of Answer Set Programs , 2014, JELIA.

[8]  Stephen Muggleton,et al.  Meta-interpretive learning: application to grammatical inference , 2013, Machine Learning.

[9]  Thomas Eiter,et al.  A model building framework for answer set programming with external computations* , 2015, Theory and Practice of Logic Programming.

[10]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[11]  Thomas G. Dietterich,et al.  Structured machine learning: the next ten years , 2008, Machine Learning.

[12]  Ramón P. Otero,et al.  Induction of Stable Models , 2001, ILP.

[13]  Thomas Eiter,et al.  Domain expansion for ASP-programs with external sources , 2016, Artif. Intell..

[14]  Oliver Ray,et al.  Nonmonotonic abductive inductive learning , 2009, J. Appl. Log..

[15]  Wolfgang Faber,et al.  Semantics and complexity of recursive aggregates in answer set programming , 2011, Artif. Intell..

[16]  Martin Gebser,et al.  Theory Solving Made Easy with Clingo 5 , 2016, ICLP.

[17]  Stephen Muggleton,et al.  To the international computing community: A new East-West challenge , 1994 .

[18]  Alan Bundy,et al.  Typed meta-interpretive learning for proof strategies , 2015, ILP.

[19]  Zhi-Hua Zhou,et al.  Logical Vision: One-Shot Meta-Interpretive Learning from Real Images , 2017, ILP.

[20]  Stephen Muggleton,et al.  Logical Minimisation of Meta-Rules Within Meta-Interpretive Learning , 2014, ILP.

[21]  Stephen Muggleton,et al.  Learning Efficient Logical Robot Strategies Involving Composable Objects , 2015, IJCAI.

[22]  Stephen Muggleton,et al.  Towards Machine Learning of Predictive Models from Ecological Data , 2014, ILP.