AI Chat AI Image Generator AI Video Text to Speech

Imparo is complete by inverse subsumption

07/14/2014

∙

by David Toth, et al.

∙

∙

In Inverse subsumption for complete explanatory induction Yamamoto et al. investigate which inductive logic programming systems can learn a correct hypothesis H by using the inverse subsumption instead of inverse entailment. We prove that inductive logic programming system Imparo is complete by inverse subsumption for learning a correct definite hypothesis H wrt the definite background theory B and ground atomic examples E, by establishing that there exists a connected theory T for B and E such that H subsumes T.

page 1

page 2

page 3

research

∙ 12/21/2021

Preprocessing in Inductive Logic Programming

Inductive logic programming is a type of machine learning in which logic...

0 Brad Hunter, et al. ∙

research

∙ 03/27/2013

The Inductive Logic of Information Systems

An inductive logic can be formulated in which the elements are not propo...

0 Norman C. Dalkey, et al. ∙

research

∙ 03/07/2000

Extending Classical Logic with Inductive Definitions

The goal of this paper is to extend classical logic with a generalized n...

0 Marc Denecker, et al. ∙

research

∙ 01/23/2013

Loglinear models for first-order probabilistic reasoning

Recent work on loglinear models in probabilistic constraint logic progra...

0 James Cussens, et al. ∙

research

∙ 04/21/2020

Learning large logic programs by going beyond entailment

A major challenge in inductive logic programming (ILP) is learning large...

4 Andrew Cropper, et al. ∙

research

∙ 01/15/2020

SMT + ILP

Inductive logic programming (ILP) has been a deeply influential paradigm...

15 Vaishak Belle, et al. ∙

research

∙ 03/05/2000

Computing Circumscriptive Databases by Integer Programming: Revisited (Extended Abstract)

In this paper, we consider a method of computing minimal models in circu...

0 Ken Satoh, et al. ∙