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 41
Page 52
... consistent with the set of examples , the LGG of these positive examples is consistent . Then check whether the LGG covers any negative examples . This check can be done in polynomial time using the constraint queries used by the ...
... consistent with the set of examples , the LGG of these positive examples is consistent . Then check whether the LGG covers any negative examples . This check can be done in polynomial time using the constraint queries used by the ...
Page 99
... consistent pair since they come from a model of a theory . The theory generated by the algorithm will ground enclose the true facts in this consistent pair with the language conjecture . It should also fail to imply any false facts ...
... consistent pair since they come from a model of a theory . The theory generated by the algorithm will ground enclose the true facts in this consistent pair with the language conjecture . It should also fail to imply any false facts ...
Page 217
... consistent , then infer the default . In non - monotonic logic , a modal logic was developed with a modal operator M , so that if p is a formula in the logic , then Mp has an intended meaning of " maybe p " or " p is consistent with ...
... consistent , then infer the default . In non - monotonic logic , a modal logic was developed with a modal operator M , so that if p is a formula in the logic , then Mp has an intended meaning of " maybe p " or " p is consistent with ...
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