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 96
Page 109
... applied to clauses with theoretical terms in the consequent , the name of the predicate is changed . Generalize is again applied twice to ( 21 ) , using ( 26 ) and ( 27 ) to yield : set ( x ) : -E ( cr ( x ) ) = 0 , E ( bd ( x ) ) = 1 ...
... applied to clauses with theoretical terms in the consequent , the name of the predicate is changed . Generalize is again applied twice to ( 21 ) , using ( 26 ) and ( 27 ) to yield : set ( x ) : -E ( cr ( x ) ) = 0 , E ( bd ( x ) ) = 1 ...
Page 347
... applied to term variables as used in the definition of ≥ we use a substitution Σ applied to predicate variables to rename or instantiate the predicate variables . Note that a substitution σ applied to term variables always leads to a ...
... applied to term variables as used in the definition of ≥ we use a substitution Σ applied to predicate variables to rename or instantiate the predicate variables . Note that a substitution σ applied to term variables always leads to a ...
Page 562
... applied to , 483-484 comparator faults in , 478 GOLEM applied to , 482-483 example faults of , 477-478 GOLEM applied to , 8 , 9 , 480-488 multiple faults in , GOLEM applied to , 484-486 operator faults in , 479 GOLEM applied to , 484 ...
... applied to , 483-484 comparator faults in , 478 GOLEM applied to , 482-483 example faults of , 477-478 GOLEM applied to , 8 , 9 , 480-488 multiple faults in , GOLEM applied to , 484-486 operator faults in , 479 GOLEM applied to , 484 ...
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