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 74
Page 122
... Horn clauses . = Proof . If we define the size of an atom to be ( the number of occurrences of functions ) + ( 2 × the number of occurrences of constants ) + ( the number of occurrences of variables ) in the atom , it is easy to see ...
... Horn clauses . = Proof . If we define the size of an atom to be ( the number of occurrences of functions ) + ( 2 × the number of occurrences of constants ) + ( the number of occurrences of variables ) in the atom , it is easy to see ...
Page 123
Stephen Muggleton. Theorem 3 Act is a set of abstraction operators complete for general Horn clauses . Proof . For any Horn clause QoQ1 , ... , Qk in LP , the atoms produced by some instantiation are in the initial set S of positive ...
Stephen Muggleton. Theorem 3 Act is a set of abstraction operators complete for general Horn clauses . Proof . For any Horn clause QoQ1 , ... , Qk in LP , the atoms produced by some instantiation are in the initial set S of positive ...
Page 243
... Horn clauses with negation . Methods that use higher - order rule schemas complement such algorithms by providing additional guidance for learning Horn clauses . How- ever , these algorithms use incomplete search heuristics that limit ...
... Horn clauses with negation . Methods that use higher - order rule schemas complement such algorithms by providing additional guidance for learning Horn clauses . How- ever , these algorithms use incomplete search heuristics that limit ...
Contents
Inductive Logic Programming | 4 |
A Framework for Inductive Logic Programming | 9 |
A Study of Constrained | 29 |
Copyright | |
45 other sections not shown
Other editions - View all
Common terms and phrases
absorption abstraction operators applied approach arguments arity Artificial Intelligence background knowledge body Buntine C₁ C₂ CIGOL clause logic CLINT Closed World Assumption complete Computer concept descriptions constrained atoms constraint predicates constraint theory constructed contains defined derivation 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 incremental inductive learning Inductive Logic Programming inference input instances instantiation integrity constraints intended interpretation inverse resolution knowledge base learnable Lemma LINUS literals Machine Learning method Morgan Kaufmann Muggleton multi-valued logic negative examples non-monotonic logic oracle PAC-learnable polynomial positive examples problem Prolog proof tree queries recursive representation resolution step restricted result RLGG rules saturation Section set of clauses Shapiro skolemized sort theory sorted atoms sparky specific subset substitution target Theorem tion true truncation tuples unit clauses variables