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 25
Page 48
... equivalent with respect to D and if and only if they cover the same sentences of D with respect to Σ.6 A sentence 2 € D is labelled as a positive example by a sentence EC and a background theory if 1 covers 2 with respect to Σ ...
... equivalent with respect to D and if and only if they cover the same sentences of D with respect to Σ.6 A sentence 2 € D is labelled as a positive example by a sentence EC and a background theory if 1 covers 2 with respect to Σ ...
Page 49
... equivalent to an unknown target sentence of C with respect to a fixed background theory E. An oracle for equivalence queries answers yes to any given query if the predicted sentence is equivalent to the target with respect to Σ ; it ...
... equivalent to an unknown target sentence of C with respect to a fixed background theory E. An oracle for equivalence queries answers yes to any given query if the predicted sentence is equivalent to the target with respect to Σ ; it ...
Page 142
... equivalent . Of course , the original CIGOL is restrictive since the resolution is not deductively complete . But this can be extended easily using another inverse substitution , which is equivalent to truncation in IRES . 4 Conclusions ...
... equivalent . Of course , the original CIGOL is restrictive since the resolution is not deductively complete . But this can be extended easily using another inverse substitution , which is equivalent to truncation in IRES . 4 Conclusions ...
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