Inductive Logic ProgrammingStephen Muggleton Inductive logic programming is a new research area emerging at present. Whilst inheriting various positive characteristics of the parent subjects of logic programming an machine learning, it is hoped that the new area will overcome many of the limitations of its forbears. This book describes the theory, implementations and applications of Inductive Logic Programming. |
From inside the book
Results 1-3 of 55
Page 52
... covers every constrained atom in s and covers no constrained atoms in S s . Such a set S is said to be shattered . Lemma 7 Let Σ be a constraint theory having C constraint predicates , and let the maximum of the arities of all ...
... covers every constrained atom in s and covers no constrained atoms in S s . Such a set S is said to be shattered . Lemma 7 Let Σ be a constraint theory having C constraint predicates , and let the maximum of the arities of all ...
Page 60
... covers a1 , ... , a ; and covers no other members of the set . Then by the definition of LGG > , the LGG , gi , of a1 , ... , ai is such a constrained atom . Then gCn ' + n + 2 > Σ > 91 , yielding a chain of size Cn ' + n + 2 . ... We ...
... covers a1 , ... , a ; and covers no other members of the set . Then by the definition of LGG > , the LGG , gi , of a1 , ... , ai is such a constrained atom . Then gCn ' + n + 2 > Σ > 91 , yielding a chain of size Cn ' + n + 2 . ... We ...
Page 171
... covers the fact p ( a1 , ... , an ) " . Definition 7 A clause c correctly covers a fact f if there is a substitution such that head ( c ) 0 = f and T2 ( body ( c ) 0 ) = true in the intended interpretation T2 . Notice the difference ...
... covers the fact p ( a1 , ... , an ) " . Definition 7 A clause c correctly covers a fact f if there is a substitution such that head ( c ) 0 = f and T2 ( body ( c ) 0 ) = true in the intended interpretation T2 . Notice the difference ...
Contents
Inductive Logic Programming | 4 |
A Framework for Inductive Logic Programming | 9 |
3 | 21 |
Copyright | |
44 other sections not shown
Other editions - View all
Common terms and phrases
0-subsumes abstraction operators applied approach arguments arity Artificial Intelligence background knowledge Buntine C₁ C₂ CIGOL CLINT Closed World Assumption complete Computer concept description constrained atoms constraint predicates constraint theory constructed contains defined definite clauses described domain theory e₁ efficient facts Figure finite first-order first-order logic flattening FOCL FOIL formula framework function symbols given GOLEM ground clause head heuristic Horn clauses hypothesis implied inductive learning Inductive Logic Programming inference input instance instantiation integrity constraints intended interpretation inverse resolution learnable learning algorithms Lemma LINUS literals Machine Learning method Morgan Kaufmann Muggleton multi-valued logic Negation as Failure negative examples non-monotonic logic occur oracle PAC-learning polynomial positive examples problem Prolog proof tree relation representation restricted RLGG rules saturation Section set of clauses Shapiro skolemized sort theory sorted atoms sparky specific subset substitution T₁ target Theorem true truncation tuples unit clauses variables