## 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 39

Page 68

We call elementary

17 , 0 ) Given the previous example of arch , one possible elementary

of E is with the Ti clause of the domain theory : Tı : column ( X ) brick ( X ) 1 ...

We call elementary

**saturation**of Ce by Cs , the following clause : Chi Te - ( Lce17 , 0 ) Given the previous example of arch , one possible elementary

**saturation**of E is with the Ti clause of the domain theory : Tı : column ( X ) brick ( X ) 1 ...

Page 72

4 Coupling

are able to build a range of generalizations of an input clause given a domain

theory in two separate steps : one reformulation step of the input clause given the

...

4 Coupling

**Saturation**and Truncation By coupling**saturation**and truncation , weare able to build a range of generalizations of an input clause given a domain

theory in two separate steps : one reformulation step of the input clause given the

...

Page 414

in fact completely

a certain hypothesis language ) . On these ... To extend the possibilities of

generalization in IRES the

is ...

in fact completely

**saturated**clauses ( constructed by CLINT from an example , ina certain hypothesis language ) . On these ... To extend the possibilities of

generalization in IRES the

**saturation**operator is used as one of them . The resultis ...

### 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