Hybrid Abductive Inductive Learning: A Generalisation of Progol

نویسندگان

  • Oliver Ray
  • Krysia Broda
  • Alessandra Russo
چکیده

The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success, it is known that Bottom Generalisation, and therefore Progol5, are restricted to finding hypotheses that lie within the semantics of Plotkin’s relative subsumption. This paper exposes a previously unknown incompleteness of Progol5 with respect to Bottom Generalisation, and proposes a new approach, called Hybrid Abductive Inductive Learning, that integrates the ILP principles of Progol5 with Abductive Logic Programming (ALP). A proof procedure is proposed, called HAIL, that not only overcomes this newly discovered incompleteness, but further generalises Progol5 by computing multiple clauses in response to a single seed example and deriving hypotheses outside Plotkin’s relative subsumption. A semantics is presented, called Kernel Generalisation, which extends that of Bottom Generalisation and includes the hypotheses constructed by HAIL.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Abductive Inductive Proof Procedure

This paper introduces a proof procedure that integrates Abductive Logic Programming (ALP) and Inductive Logic Programming (ILP) to automate the learning of first order Horn clause theories from examples and background knowledge. The work builds upon a recent approach called Hybrid Abductive Inductive Learning (HAIL) by showing how language bias can be practically and usefully incorporated into ...

متن کامل

Hybrid abductive inductive learning

This thesis introduces a new Machine Learning technique called Hybrid Abductive Inductive Learning (HAIL) that integrates Abductive Logic Programming (ALP) and Inductive Logic Programming (ILP) in order to automate the learning of first-order theories from examples and prior knowledge. A semantics is proposed called Kernel Set Subsumption (KSS) that generalises the well-known inference method o...

متن کامل

An Introduction to Inductive Logic Programming and Learning Language in Logic

This chapter introduces Inductive Logic Programming (ILP) and Learning Language in Logic (LLL). No previous knowledge of logic programming, ILP or LLL is assumed. Elementary topics are covered and more advanced topics are discussed. For example, in the ILP section we discuss subsumption, inverse resolution, least general generalisation, relative least general generalisation, inverse entailment,...

متن کامل

Learning Stochastic Logic Programs

Stochastic Logic Programs (SLPs) have been shown be a generalisation of Hidden Markov Models (HMMs), stochastic context-free grammars, and directed Bayes’ nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a first-order range-restricted definite clause. This paper summarises the syntax, distributional semantics and proof techniqu...

متن کامل

Using Abduction for Induction of Normal Logic Programs

This paper proposes the approach of eXtended Hybrid Abductive Inductive Learning (XHAIL) for generalising positive and negative examples with respect to normal logic programs. A proof procedure is described that uses abduction to realise the abductive, deductive, and inductive phases which comprise this approach.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003