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

Only variables have been constrained in the examples so far . The definition of

constrained atoms allows arbitrary terms to be constrained . ... A

is any first - order theory whose only predicates are constraint predicates .

Only variables have been constrained in the examples so far . The definition of

constrained atoms allows arbitrary terms to be constrained . ... A

**constraint theory**is any first - order theory whose only predicates are constraint predicates .

Page 34

to a given

subset of 7 according to £ if and only if & EVI1 . ... The variables of an ordinary or

constrained atom may be interpreted as existentially or universally quantified .

to a given

**constraint theory**E . For n - ary constraint predicates t ' and T , T ' is asubset of 7 according to £ if and only if & EVI1 . ... The variables of an ordinary or

constrained atom may be interpreted as existentially or universally quantified .

Page 52

Thus by Lemma 6 this chain of predicted constrained atoms ordered by Ze has

length at most Cn " + n + 1 . Hence the algorithm ... C and s are constant for a

fixed

noted ...

Thus by Lemma 6 this chain of predicted constrained atoms ordered by Ze has

length at most Cn " + n + 1 . Hence the algorithm ... C and s are constant for a

fixed

**constraint theory**, so this number of predictions is polynomial in n . O Asnoted ...

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