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-5 of 28
Page viii
... FOCL 335 336 337 339 345 353 354 361 362 362 364 367 370 371 373 374 375 377 4 Experimental Evaluation of FOCL 385 5 Related Work 391 viii Contents.
... FOCL 335 336 337 339 345 353 354 361 362 362 364 367 370 371 373 374 375 377 4 Experimental Evaluation of FOCL 385 5 Related Work 391 viii Contents.
Page ix
Stephen Muggleton. 4 Experimental Evaluation of FOCL 385 5 Related Work 391 6 Conclusions 392 Part 3 Experiments and Applications 19 Analogical Reasoning for Logic Programming B. Tausend and S. Bell 1 2 Introduction ... Learning ...
Stephen Muggleton. 4 Experimental Evaluation of FOCL 385 5 Related Work 391 6 Conclusions 392 Part 3 Experiments and Applications 19 Analogical Reasoning for Logic Programming B. Tausend and S. Bell 1 2 Introduction ... Learning ...
Page 236
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 239
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 240
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Contents
Inductive Logic Programming | 4 |
A Framework for Inductive Logic Programming | 9 |
Constraints for Predicate Invention | 14 |
Inducing Temporal Fault Diagnostic Rules from a Qualitative | 24 |
A Study of Constrained | 29 |
2 | 30 |
4 | 35 |
7 | 45 |
Related Work | 313 |
Refinement Graphs for FOIL and LINUS | 319 |
4 | 327 |
Controlling the Complexity of Learning in Logic through Syn | 336 |
Efficient Learning of Logic Programs with NonDeterminate | 361 |
An InformationBased Approach to Integrating Empirical | 373 |
Analogical Reasoning for Logic Programming | 397 |
Some Thoughts on Inverse Resolution | 409 |
Extensions of Inversion of Resolution Applied to Theory Com | 63 |
879 | 77 |
Ranan B Banerji | 93 |
3 | 98 |
Logic Program Synthesis from Good Examples | 113 |
A Critical Comparison of Various Methods Based on Inverse | 131 |
4 | 139 |
NonMonotonic Learning | 145 |
An Overview of the Interactive ConceptLearner and Theory | 163 |
5 | 179 |
Richards | 214 |
Relating Relational Learning Algorithms | 233 |
Machine Invention of FirstOrder Predicates by Inverting | 261 |
Integrating Abduction and Induction | 300 |
4 | 306 |
Department of Computer Science Katholieke Universiteit Leuven Celestij | 422 |
Experiments in Nonmonotonic FirstOrder Induction | 423 |
Learning Qualitative Models of Dynamic Systems | 437 |
The Application of Inductive Logic Programming to Finite | 453 |
Model | 471 |
4 | 480 |
4 | 502 |
8 | 510 |
Learning Chess Patterns | 517 |
Applying Inductive Logic Programming in Reactive Environ | 539 |
5 | 547 |
551 | |
559 | |
Other editions - View all
Common terms and phrases
0-subsumes absorption abstraction operators Algorithmic Learning Theory applied approach arguments arity Artificial Intelligence background knowledge body Buntine C₁ C₂ CIGOL CLINT Closed World Assumption complete Computer concept descriptions constrained atoms constraint predicates constraint theory constructed contains defined definite clauses described domain theory e₁ efficient facts finite first-order first-order logic flattening FOCL formula framework function symbols given GOLEM ground clause head heuristic Horn clauses hypothesis implied inductive learning Inductive Logic Programming inference input instances instantiation integrity constraints intended interpretation inverse resolution knowledge base learnable learning algorithms Lemma literals Machine Learning method Morgan Kaufmann Muggleton negative examples non-monotonic logic oracle PAC-learning polynomial positive examples problem Proceedings Prolog proof tree relation representation restricted RLGG Rouveirol 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
Popular passages
Page ix - Department of Information and Computer Science University of California, Irvine, CA 92717 Abstract As methodologies and tools for chip-level design mature, design effort becomes focused on higher abstraction levels.