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

Page 50

Therefore ,

sorted atoms or polynomially learn sorted atoms by ... That is , if we

NP - complete problems cannot be solved in random polynomial time . learning .

Therefore ,

**assuming**R E NP , no algorithms exist that polynomially PAClearnsorted atoms or polynomially learn sorted atoms by ... That is , if we

**assume**theNP - complete problems cannot be solved in random polynomial time . learning .

Page 132

l , and l2 in C1 and C2 respectively such that 0 is the MGU of al , and 12 . We

obtain the resolvent C of Ci and C2 by the substitution 0 . In fact , there exist 01

and ...

**Assume**that the clauses have no variables in common , and consider two literalsl , and l2 in C1 and C2 respectively such that 0 is the MGU of al , and 12 . We

obtain the resolvent C of Ci and C2 by the substitution 0 . In fact , there exist 01

and ...

Page 151

We must now prove that QUSE Q ' for every clause set Q ' which is a correct -

specialization of T .

of T and QUSHQ ' . Thus , applying Lemma 4 , it is not the case that for every

clause ...

We must now prove that QUSE Q ' for every clause set Q ' which is a correct -

specialization of T .

**Assume**that there exists Q ' which is a correctspecializationof T and QUSHQ ' . Thus , applying Lemma 4 , it is not the case that for every

clause ...

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