From Inverse Entailment to Inverse Subsumption

نویسندگان

  • Yoshitaka Yamamoto
  • Katsumi Inoue
  • Koji Iwanuma
چکیده

Modern explanatory ILP methods like Progol, Residue procedure, CF-induction, HAIL and Imparo use the principle of Inverse Entailment (IE). It is based on the fact that the negation of a hypothesis is derived from a prior background theory and the negation of examples. IE-based methods commonly compute a hypothesis in two steps: by first constructing an intermediate theory and next by generalizing its negation into the hypothesis with the inverse relation of entailment. In this paper, we focus on the sequence of intermediate theories that constructs a derivation from the background theory and the negation of examples to the negation of the hypothesis. We then show the negations of those derived theories in a sequence are represented with inverse subsumption. Using our result, inverse entailment can be reduced into inverse subsumption, while it preserves the completeness for finding hypotheses.

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

ثبت نام

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

منابع مشابه

Imparo is complete by inverse subsumption

In Inverse subsumption for complete explanatory induction[YII12] 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 t...

متن کامل

Generalised Kernel Sets for Inverse Entailment

The task of inverting logical entailment is of central importance to the disciplines of Abductive and Inductive Logic Programming (ALP& ILP). Bottom Generalisation (BG) is a widely applied approach for Inverse Entailment (IE), but is limited to deriving single clauses from a hypothesis space restricted by Plotkin’s notion of C-derivation. Moreover, known practical applications of BG are confine...

متن کامل

Searching the Subsumption Lattice by a Genetic Algorithm

A framework for combining Genetic Algorithms with ILP methods is introduced and a novel binary representation and relevant genetic operators are discussed. It is shown that the proposed representation encodes a subsumption lattice in a complete and compact way. It is also shown that the proposed genetic operators are meaningful and can be interpreted in ILP terms such as lgg(least general gener...

متن کامل

Completing Inverse Entailment

Yamamoto has shown that the Inverse Entailment (IE) mechanism described previously by the author is complete for Plotkin's relative subsumption but incomplete for entailment. That is to say, an hy-pothesised clause H can be derived from an example E under a background theory B using IE if and only if H subsumes E relative to B in Plotkin's sense. Yamamoto gives examples of H for which B H j = E...

متن کامل

Comparison of Upward and Downward Generalizations in CF-Induction

CF-induction is a sound and complete procedure for finding hypotheses in full clausal theories. It is based on the principle of Inverse Entailment (IE), and consists of two procedures: construction of a bridge theory and generalization of it. There are two possible ways to realize the generalization task in CF-induction. The one uses a single deductive operator, called γ-operator, and the other...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2010