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

Page 73

Each new predicate introduced has thus to be

replaces , so that the transformation is reversible . Definitions : * We call the

flattening predicate fp associated with the functor f of arity in , the so

predicate of ...

Each new predicate introduced has thus to be

**defined**in regard to the term itreplaces , so that the transformation is reversible . Definitions : * We call the

flattening predicate fp associated with the functor f of arity in , the so

**defined**predicate of ...

Page 267

Places within terms or literals are denoted by n - tuples and

as follows . The term at ... The

places within clauses by assuming a fixed ordering on literals within a clause .

Places within terms or literals are denoted by n - tuples and

**defined**recursivelyas follows . The term at ... The

**definition**of place can easily be extended to coverplaces within clauses by assuming a fixed ordering on literals within a clause .

Page 378

1 Intensionally

literal , it is necessary to count the number of tuples that would still be covered by

a clause after adding a new literal to the current clause . If the literal is formed ...

1 Intensionally

**defined**predicates In order to compute the information gain of aliteral , it is necessary to count the number of tuples that would still be covered by

a clause after adding a new literal to the current clause . If the literal is formed ...

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