Results 1 - 10
of
619
Mode-Directed Inverse Entailment for Full Clausal Theories
"... Abstract. Mode declarations are a successful form of language bias in explanatory ILP. But, while they are heavily used in Horn systems, they have yet to be similarly exploited in more expressive clausal settings. This paper presents a mode-directed ILP procedure for full clausal logic. It employs a ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
Abstract. Mode declarations are a successful form of language bias in explanatory ILP. But, while they are heavily used in Horn systems, they have yet to be similarly exploited in more expressive clausal settings. This paper presents a mode-directed ILP procedure for full clausal logic. It employs
Inverse entailment and Progol
, 1995
"... This paper firstly provides a re-appraisal of the development of techniques for inverting deduction, secondly introduces Mode-Directed Inverse Entailment (MDIE) as a generalisation and enhancement of previous approaches and thirdly describes an implementation of MDIE in the Progol system. Progol ..."
Abstract
-
Cited by 719 (61 self)
- Add to MetaCart
This paper firstly provides a re-appraisal of the development of techniques for inverting deduction, secondly introduces Mode-Directed Inverse Entailment (MDIE) as a generalisation and enhancement of previous approaches and thirdly describes an implementation of MDIE in the Progol system. Progol
OHMSHA, LTD. and Springer-Verlag A,
, 1995
"... Abstract This paper firstly provides a re-appraisal of the develop-ment of techniques for inverting deduction, secondly introduces Mode-Directed Inverse Entailment (MDIE) as a generalisation and enhancement of previous approaches and thirdly describes an implementation f MDIE in the Progol system. P ..."
Abstract
- Add to MetaCart
Abstract This paper firstly provides a re-appraisal of the develop-ment of techniques for inverting deduction, secondly introduces Mode-Directed Inverse Entailment (MDIE) as a generalisation and enhancement of previous approaches and thirdly describes an implementation f MDIE in the Progol system
ILP:- Just Trie It
"... Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques have been proposed to address the efficiency issue. Such proposals include query transformations, query packs, lazy eval ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Directed Inverse Entailment (MDIE) systems. In the first stage of a MDIE system, where the bottom clause is constructed, we store not only the bottom clause but also valuable additional information. The information stored is sufficient to evaluate the clauses constructed in the second stage without
Inverse Entailment in
- In Proc. of the 10th International Conference on Inductive Logic Programming, ILP 00, LNAI 1866
, 2000
"... Inverse entailment (IE) is known as a technique for finding inductive hypotheses in Horn theories. When a background theory is nonmonotonic, however, IE is not applicable in its present form. The purpose of this paper is extending the IE technique to nonmonotonic inductive logic programming (ILP ..."
Abstract
- Add to MetaCart
Inverse entailment (IE) is known as a technique for finding inductive hypotheses in Horn theories. When a background theory is nonmonotonic, however, IE is not applicable in its present form. The purpose of this paper is extending the IE technique to nonmonotonic inductive logic programming
Theory completion using Inverse Entailment
, 2000
"... The main real-world applications of Inductive Logic Programming (ILP) to date involve the "Observation Predicate Learning" (OPL) assumption, in which both the examples and hypotheses define the same predicate. However, in both scientific discovery and language learning potential applicatio ..."
Abstract
-
Cited by 57 (26 self)
- Add to MetaCart
applications exist in which OPL does not hold. OPL is ingrained within the theory and performance testing of Machine Learning. A general ILP technique called "Theory Completion using Inverse Entailment" (TCIE) is introduced which is applicable to non-OPL applications. TCIE is based on inverse
Completing Inverse Entailment
- In Proc. of the 8th International Workshop on Inductive Logic Programming, ILP 98, LNAI 1446
, 1998
"... . 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 hypothesised clause H can be derived from an example E under a background theory B using IE if and ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
. 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 hypothesised clause H can be derived from an example E under a background theory B using IE
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. Such a form of incompleteness impedes the learning of mutually recursive definitions such as those found in grammar learning. ..."
Abstract
- Add to MetaCart
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. Such a form of incompleteness impedes the learning of mutually recursive definitions such as those found in grammar learning
Inverse Entailment for Full Clausal Theories
- In: LICS-2001 Workshop on Logic and Learning
, 2001
"... This paper shows a sound and complete method for inverse entailment in inductive logic programming. We show that inverse entailment can be computed with a resolution method for consequencefinding. In comparison with previous work, induction via consequence-finding is sound and complete for finding h ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
This paper shows a sound and complete method for inverse entailment in inductive logic programming. We show that inverse entailment can be computed with a resolution method for consequencefinding. In comparison with previous work, induction via consequence-finding is sound and complete for finding
Generalised Kernel Sets for Inverse Entailment
"... Abstract. 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 hypothesi ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Abstract. 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
Results 1 - 10
of
619