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 87
Page 7
... logic programming , will emerge . 2.1 Past and present research In his thesis Plotkin [ 32 ] laid the foundations for much of the present activity . Plotkin did not restrict himself to Horn clause logic . This is hardly surprising given ...
... logic programming , will emerge . 2.1 Past and present research In his thesis Plotkin [ 32 ] laid the foundations for much of the present activity . Plotkin did not restrict himself to Horn clause logic . This is hardly surprising given ...
Page 147
... clauses or conjunctions of clauses . 1.3 Previous incremental specialization techniques = Shapiro [ 38 ] described an incremental Program Debugging System ( PDS ) which recognizes three different types of bug within Horn clause logic ...
... clauses or conjunctions of clauses . 1.3 Previous incremental specialization techniques = Shapiro [ 38 ] described an incremental Program Debugging System ( PDS ) which recognizes three different types of bug within Horn clause logic ...
Page 338
... clause ) , and increasingly more relations between those variables . In GOLEM [ 21 ] , the related notion of ij - determinacy is used that limits the indeterminate introduction of new variables in the body of a clause . Both of those ...
... clause ) , and increasingly more relations between those variables . In GOLEM [ 21 ] , the related notion of ij - determinacy is used that limits the indeterminate introduction of new variables in the body of a clause . Both of those ...
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