Martin, L., Vrain, C.: A three-valued framework for the induction of general logic programs, in: Advances in Inductive Logic Programming (L. De Raedt, Ed.), IOS Press, Amsterdam, 1996, 219--235. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Representation of Incomplete Knowledge by Induction of.. - Nicolas, Duval (2001) (1 citation) (Correct)
.... of a single target predicate and B and H are de nite Horn clauses (but some systems [6] induce full rst order theories) The ILP community has also considered the problem of using more expressive formalisms, specially in systems that construct clauses containing the negation as failure operator [1, 2, 15]. The problem that we consider in this paper extends [9] and concerns the simultaneous learning of de nitions for a predicate p and its negation :p. So in our framework, negative examples for a predicate p will play the full role of leading to explicit de nitions of :p. The relevance of this ....
L. Martin and C. Vrain. A three-valued framework for the induction of general logic programs. In L. De Raedt, editor, Advances in Inductive Logic Programming, pages 219235. IOS Press, 1996.
Identification in the limit and Constraint ILP - Richard (Correct)
....(numerical values, nite domain values, intervals, To easily introduce negative examples like ( x 6= 0] p(x) specifying with a single constrained atom an in nite set of counter examples for property p. Consequently, there is a lot of works addressing this problem : one may cite [7, 11, 2, 15, 10]. These works focus on the integration in classical inductive process of new formulas (the constraints) which will be treated with speci c algorithms. In this paper, we are mainly concerned by the formal setting of ILP within a constraint framework, whatever the underlying machinery would be. Of ....
L. Martin and C. Vrain. A three-valued framework for the induction of general logic programs. In L. De Raedt, editor, Advances in Inductive Logic Programming, pages 219-235, 1995.
Updates, Induction and Abduction in Deductive Databases - Vrain, Laurent (2 citations) Self-citation (Vrain) (Correct)
....target predicate, the program composed of the clause q( x) q( x) extensionally covers the positive examples and rejects the negative ones, but all ground 2 atoms are false w.r.t. the well founded semantics. To deal with this problem, the notion of recursive dependencies has been introduced in [14] where it is shown that the programs P built by MULT ICN are complete and consistent, i.e. we have E [ E Gamma M(P [ BK) Non extensional coverage versus extensional rejection Most empirical systems ( 16, 17] search for a program that covers no negative examples whereas MULT ICN ....
Martin L., Vrain C.: A Three-Valued Framework for the Induction of General Logic Programs. Advances in Inductive Logic Programming. L. de Raedt (Ed.), IOS Press (1996) pp. 219-235.
Induction of Contraint Logic Programs - Martin, Vrain Self-citation (Martin) (Correct)
....Such a valuation is called a covering valuation for e. The aim is to find a constrained program built over Sigma ; Pi C ; and Pi P which D covers the positive examples and which D covers no negative ones. In the field of Inductive Logic Programming, it has already been shown (see for instance [6]) that the notion of extensional coverage is not a sufficient condition for learning complete and consistent programs. This is still true when learning constrained logic programs. Nevertheless, in this paper we only propose a way of building constrained clauses based on the notion of D coverage ....
Martin L., Vrain Ch., 1996. A Three-Valued Framework for the Induction of General Logic Programs. Advances in Inductive Logic Programming. L. de Raedt (Ed.), IOS Press, pp. 219-235.
An efficient validation mechanism for Inductive Logic.. - Lallouet, Martin (1995) Self-citation (Martin) (Correct)
....a depth h, for a given h. With this technique, the procedure always gives an answer in finite time but it becomes incorrect, ie it may consider that P [ f Gg does not have any SLD refutation even if G is a logical consequence of P . Bottom up evaluation of the semantics The system MULT ICN [20] [21], 19] computes the semantics of the program, ie the least fixpoint of either the operator of the well founded semantics or the operator of Fitting s semantics (they are defined in section 3.2) In order to reduce the complexity of such a computation, MULT ICN computes the semantics of a ....
Lionel Martin and Christel Vrain. A three-valued framework for the induction of general logic programs. In Luc de Raedt, editor, International Workshop on Inductive Logic Programming, pages 109--127. Katholieke Universiteit Leuven, Belgium, September 1995.
Learning Recursive Theories in the Normal ILP Setting - Malerba (2003) (1 citation) (Correct)
No context found.
Martin, L., Vrain, C.: A three-valued framework for the induction of general logic programs, in: Advances in Inductive Logic Programming (L. De Raedt, Ed.), IOS Press, Amsterdam, 1996, 219--235.
Nonmonotonic Inductive Logic Programming - Sakama (Correct)
No context found.
L. Martin and C. Vrain. A three-valued framework for the induction of general logic programs. In: L. De Raedt (ed.), Advances in Inductive Logic Programming, IOS Press, pp. 219--235, 1996.
Inverse Entailment in - Nonmonotonic Logic Programs (2000) (Correct)
No context found.
L. Martin and C. Vrain. A three-valued framework for the induction of general logic programs. In: L. De Raedt (ed.) Advances in Inductive Logic Programming, IOS Press, pp. 219--235, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC