by
Luc De Raedt
,
Wim Van Laer

Citations: | 88 - 19 self |

@INPROCEEDINGS{Raedt95inductiveconstraint,

author = {Luc De Raedt and Wim Van Laer},

title = {Inductive Constraint Logic},

booktitle = {},

year = {1995},

pages = {80--94},

publisher = {Springer-Verlag}

}

. A novel approach to learning first order logic formulae from positive and negative examples is presented. Whereas present inductive logic programming systems employ examples as true and false ground facts (or clauses), we view examples as interpretations which are true or false for the target theory. This viewpoint allows to reconcile the inductive logic programming paradigm with classical attribute value learning in the sense that the latter is a special case of the former. Because of this property, we are able to adapt AQ and CN2 type algorithms in order to enable learning of full first order formulae. However, whereas classical learning techniques have concentrated on concept representations in disjunctive normal form, we will use a clausal representation, which corresponds to a conjuctive normal form where each conjunct forms a constraint on positive examples. This representation duality reverses also the role of positive and negative examples, both in the heuristics and in the a...

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2014 The Pennsylvania State University