Best-Effort Inductive Logic Programming via Fine-grained Cost-based Hypothesis Generation

by   Peter Schüller, et al.

We describe the Inspire system which participated in the first competition on Inductive Logic Programming (ILP). Inspire is based on Answer Set Programming (ASP), its most important feature is an ASP encoding for hypothesis space generation: given a set of facts representing the mode bias, and a set of cost configuration parameters, each answer set of this encoding represents a single rule that is considered for finding a hypothesis that entails the given examples. Compared with state-of-the-art methods that use the length of the rule body as a metric for rule complexity, our approach permits a much more fine-grained specification of the shape of hypothesis candidate rules. Similar to the ILASP system, our system iteratively increases the rule cost limit until it finds a suitable hypothesis. Different from ILASP, our approach generates a new search space for each cost limit. The Inspire system searches for a hypothesis that entails a single example at a time, utilizing a simplification of the ASP encoding used in the XHAIL system. To evaluate ASP we use Clingo. We perform experiments with the development and test set of the ILP competition. For comparison we also adapted the ILASP system to process competition instances. Experimental results show, that Inspire performs better than ILASP, and that cost parameters for the hypothesis search space are an important factor for finding suitable hypotheses efficiently.


page 1

page 2

page 3

page 4


Conflict-driven Inductive Logic Programming

The goal of Inductive Logic Programming (ILP) is to learn a program that...

The Power of Non-Ground Rules in Answer Set Programming

Answer set programming (ASP) is a well-established logic programming lan...

Improving Scalability of Inductive Logic Programming via Pruning and Best-Effort Optimisation

Inductive Logic Programming (ILP) combines rule-based and statistical ar...

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

Meta-Interpretive Learning (MIL) learns logic programs from examples by ...

Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification

The Inductive Logic Programming community has considered proof-complexit...

The third open Answer Set Programming competition

Answer Set Programming (ASP) is a well-established paradigm of declarati...

FOLD-R++: A Toolset for Automated Inductive Learning of Default Theories from Mixed Data

FOLD-R is an automated inductive learning algorithm for learning default...

Please sign up or login with your details

Forgot password? Click here to reset