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 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 .
منابع مشابه
From Inverse Entailment to Inverse Subsumption
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 generalizi...
متن کاملSubsumption and Reenement in Model Inference
In his famous Model Inference System, Shapiro 10] uses so-called reenement operators to replace too general hypotheses by logically weaker ones. One of these reenement operators works in the search space of reduced rst order sentences. In this article we show that this operator is not complete for reduced sentences, as he claims. We investigate the relations between subsumption and reenement as...
متن کامل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...
متن کاملKIT REPORT 91 A Correspondence Theory for Terminological Logics: Preliminary Report
We show that the terminological logic ALC comprising Boolean operations on concepts and value restrictions is a notational variant of the propositional modal logic K(m). To demonstrate the utility of the correspondence, we give two of its immediate by-products. Namely, we axiomatize ALC and give a simple proof that subsumption in ALC is PSPACE-complete, replacing the original six-page one. Furt...
متن کاملInverting Implication
All generalisations within logic involve inverting implication. Yet, ever since Plotkin's work in the early 1970's methods of generalising rst-order clauses have involved inverting the clausal subsumption relationship. However , even Plotkin realised that this approach was incomplete. Since inversion of subsumption is central to many Inductive Logic Programming approaches, this form of incomple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1407.3836 شماره
صفحات -
تاریخ انتشار 2014