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 83
Page 50
... problem , C and D are both the class of universally closed constrained atoms , and T is the class of constraint theories for which the time to answer constraint queries is bounded by some polynomial in the size of the query . For ...
... problem , C and D are both the class of universally closed constrained atoms , and T is the class of constraint theories for which the time to answer constraint queries is bounded by some polynomial in the size of the query . For ...
Page 56
... problem more complex . This third extension was included for expressiveness rather than efficiency . We call the problem that results from retracting this third extension , forcing all constraint predicates to be monadic , the extended ...
... problem more complex . This third extension was included for expressiveness rather than efficiency . We call the problem that results from retracting this third extension , forcing all constraint predicates to be monadic , the extended ...
Page 398
... problem by making use of the known solution of a similar problem . Basically , analogical reasoning aims at mapping knowledge from a well - understood domain , the so - called source domain , to a new domain called the target domain in ...
... problem by making use of the known solution of a similar problem . Basically , analogical reasoning aims at mapping knowledge from a well - understood domain , the so - called source domain , to a new domain called the target domain in ...
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