Refinement Type Directed Search for Meta-Interpretive-Learning of Higher-Order Logic Programs

02/18/2021
by   Rolf Morel, et al.
0

The program synthesis problem within the Inductive Logic Programming (ILP) community has typically been seen as untyped. We consider the benefits of user provided types on background knowledge. Building on the Meta-Interpretive Learning (MIL) framework, we show that type checking is able to prune large parts of the hypothesis space of programs. The introduction of polymorphic type checking to the MIL approach to logic program synthesis is validated by strong theoretical and experimental results, showing a cubic reduction in the size of the search space and synthesis time, in terms of the number of typed background predicates. Additionally we are able to infer polymorphic types of synthesized clauses and of entire programs. The other advancement is in developing an approach to leveraging refinement types in ILP. Here we show that further pruning of the search space can be achieved, though the SMT solving used for refinement type checking comes

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/16/2019

Resource-Guided Program Synthesis

This article presents resource-guided synthesis, a technique for synthes...
03/31/2018

Synthesis of Differentiable Functional Programs for Lifelong Learning

We present a neurosymbolic approach to the lifelong learning of algorith...
11/13/2017

A Type Checking Algorithm for Higher-rank, Impredicative and Second-order Types

We study a type checking algorithm that is able to type check a nontrivi...
06/24/2017

Local Refinement Typing

We introduce the Fusion algorithm for local refinement type inference, y...
03/17/2000

Detecting Unsolvable Queries for Definite Logic Programs

In solving a query, the SLD proof procedure for definite programs someti...
10/24/2018

Type-directed Bounding of Collections in Reactive Programs

Our aim is to statically verify that in a given reactive program, the le...
12/16/2019

User Friendly Automatic Construction of Background Knowledge: Mode Construction from ER Diagrams

One of the key advantages of Inductive Logic Programming systems is the ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.