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

Page 98

It will be recalled that in the backtrace algorithm the oracle needs to be

questioned about the truth values of

special proof trees in Corollary 1 allows us to do this in a manner somewhat

different from ...

It will be recalled that in the backtrace algorithm the oracle needs to be

questioned about the truth values of

**ground**clauses only . The structure of thespecial proof trees in Corollary 1 allows us to do this in a manner somewhat

different from ...

Page 99

A theory T will be said to enclose a set S of

clause in S . It

S bound by L subsumes a

an ...

A theory T will be said to enclose a set S of

**ground**clauses if T implies everyclause in S . It

**ground**encloses S with a language conjecture L if each clause inS bound by L subsumes a

**ground**clause in T . The**ground**clauses occurring inan ...

Page 101

D . Given two theories T and T ' we shall say I ' < T if for each

in T there is a

T ' are identical and such that every non -

D . Given two theories T and T ' we shall say I ' < T if for each

**ground**clause P - Ain T there is a

**ground**clause P - B in T ' with A Ç B or the**ground**clause of T andT ' are identical and such that every non -

**ground**clause in T ' is in T . Lemma 6 ...### 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