## Inductive Logic ProgrammingInductive logic programming is a new research area formed at the intersection of machine learning and logic programming. While the influence of logic programming has encouraged the development of strong theoretical foundations, this new area is inheriting its experimental orientation from machine learning. Inductive Logic Programming will be an invaluable text for all students of computer science, machine learning and logic programming at an advanced level. * * Examination of the background to current developments within the area * Identification of the various goals and aspirations for the increasing body of researchers in inductive logic programming * Coverage of induction of first order theories, the application of inductive logic programming and discussion of several logic learning programs * Discussion of the applications of inductive logic programming to qualitative modelling, planning and finite element mesh design |

### From inside the book

Results 1-3 of 58

Page 52

If the LGG ,

examples . Otherwise , no constrained atom is consistent with the set of examples

: that is , the target sentence is not a constrained atom . The mistake bound for ...

If the LGG ,

**covers**no negative examples , then it is consistent with the set ofexamples . Otherwise , no constrained atom is consistent with the set of examples

: that is , the target sentence is not a constrained atom . The mistake bound for ...

Page 60

For each atom in the set , there is a way to exclude , or fail to

atom , and these ways of exclusion are orthogonal . For example ... For any

subset we construct an atom that

others .

For each atom in the set , there is a way to exclude , or fail to

**cover**, only thatatom , and these ways of exclusion are orthogonal . For example ... For any

subset we construct an atom that

**covers**the atoms in the subset and excludes theothers .

Page 171

Definition 7 A clause c correctly

head ( c ) 8 = f and T2 ( body ( c ) 0 ) = true in the intended interpretation T2 .

Notice the difference between correctly

...

Definition 7 A clause c correctly

**covers**a fact f if there is a substitution 0 such thathead ( c ) 8 = f and T2 ( body ( c ) 0 ) = true in the intended interpretation T2 .

Notice the difference between correctly

**covers**and**covers**( Definition 3 ) .**Covers**...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Inductive Logic Programming | 4 |

A Framework for Inductive Logic Programming | 9 |

oor A | 22 |

Copyright | |

26 other sections not shown

### Other editions - View all

### Common terms and phrases

algorithm allows applied approach arguments assume background knowledge base body called CIGOL CLINT complete Computer concept consistent constrained atoms constraint constructed contains correct corresponding covers defined definition derivation described domain theory efficient equivalent examples exists explanation expression extend facts false Figure finite first-order formula function given GOLEM ground head Horn clauses hypothesis implied inductive inference input instances Intelligence introduced inverse knowledge knowledge base language least limit literals Logic Programming Machine Learning method Muggleton negative examples non-monotonic Note occur operator ordinary polynomial positive positive examples possible predicates present problem Proceedings proof properties prove queries reasoning relation replacing representation representative resolution respect restricted result rules saturation sentences similar sorted atoms space specialization specific step structure substitution symbol Theorem theory tree true values variables