[ ILPnet2 | Library | Newsletter | CSCW | Education | End-User Club | Events | Nodes | Systems | Applications | Members only ]
Normal Forms for Inductive Logic Programming
P.A. Flach.
In S. Dzeroski
and N. Lavrac, editors, Proceedings of the 7th
International Workshop on Inductive Logic Programming, volume 1297 of
Lecture Notes in Artificial Intelligence, pages 149--156.
Springer-Verlag, 1997.
Abstract
In this paper we study induction of unrestricted clausal theories from
interpretations. First, we show that in the propositional case induction from
complete evidence can be seen as an equivalence-preserving transformation
from DNF to CNF. From this we conclude that induction is essentially a
process of determining what is false in the domain of discourse. We then
proceed by investigating dual normal forms for evidence and hypotheses in
predicate logic. We define evidence normal form (ENF), which is Skolemised
existential DNF under a Consistent Naming Assumption. Because ENF is
incomplete, in the sense that it does not have the expressive power of
clausal logic, ENF evidence requires the identifi-cation of Skolem terms. The
approach is partly implemented in the PRIMUS system.
BibTeX entry.
Other publications
P A Flach,
Peter.Flach@bristol.ac.uk. Last modified on Wednesday 9 April 2003 at 18:31. © 2003 ILPnet2