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

Page 85

There are , however , different systems that have been more influenced by

explanation based learning and that perform top - down induction by completing

partial

the ...

There are , however , different systems that have been more influenced by

explanation based learning and that perform top - down induction by completing

partial

**proof**trees ( 29 ] , [ 30 ] , [ 5 ] . They proceed in two steps : the first step isthe ...

Page 96

antecedant has 1 literals . Since the number of variables , constants , functions

and predicates in the theory is finite , the number of predicates with terms of

depth k ...

**Proof**. Let S be a clause which has no term of depth greater than k and whoseantecedant has 1 literals . Since the number of variables , constants , functions

and predicates in the theory is finite , the number of predicates with terms of

depth k ...

Page 97

If D has only base atoms then there is nothing to prove , since by the induction

hypothesis on the depth of the tree , the

written in the desired form . Else let M ( t1 , . . . , tn ) occur in D . Let us denote this

...

If D has only base atoms then there is nothing to prove , since by the induction

hypothesis on the depth of the tree , the

**proof**of S from the father of S can bewritten in the desired form . Else let M ( t1 , . . . , tn ) occur in D . Let us denote this

...

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