Inductive Logic Programming: Theory and methods

The Journal of Logic Programming

Volumn 19-20, Issue SUPPL. 1, 1994, Pages 629-679

  Muggleton, Stephen ^a   de Raedt, Luc ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; DATA COMPRESSION; LEARNING SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROGRAMMING THEORY; THEOREM PROVING;

COMPUTATIONAL LEARNING THEORY; FIRST ORDER CLAUSAL THEORIES; INDUCTIVE LOGIC PROGRAMMING (ILP);

LOGIC PROGRAMMING;

EID: 0028429573     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(94)90035-3     Document Type: Article

References (149)

1. Theory revision
2. Hydra: A Noise Tolerant Relational Concept-Learning Algorithm
3. On the Complexity of Minimum Inference of Regular Sets
4. Learning in the Limit in a Growing Language
5. Learning Theoretical Terms
6. Learning Mutually Dependent Relations
7. On the Close Relationship Between FOIL and the Frameworks of Helft and Plotkin
8. Towards an Inductive Logic Programming Language
9. Concept Acquisition in Noisy Environments
10. An Interactive System to Learn Functional Logic Programs
11. Fundamental Mechanisms in Machine Learning and Inductive Inference
12. The Inference of Regular LISP Programs from Examples
13. On the Synthesis of Finite-State Machines from Samples of their Behavior
14. Constructing Programs from Example Computations
15. Inductive Learning Applied to Program Construction and Verification
16. Learning Qualitative Models of Dynamic Systems
17. An Investigation of Noise-Tolerant Relational Concept Learning Algorithms
18. An Instance of Abstract Interpretation Integrating Type and Mode Inferencing
19. Intensional Updates: Abduction via Deduction
20. Induction of Horn-Clauses: Methods and the Plausible Generalization Algorithm
21. Generalised Subsumption and Its Applications to Induction and Redundancy
22. Compiling Knowledge into an Explicit Bias
23. Grammatically Biased Learning: Learning Logic Programs Using an Explicit Antecedent Description Language
24. Learnability of Restricted Logic Programs
25. PAC-Learning a Restricted Class of Recursive Logic Programs
26. Concept-Sharing: A Means to Improve Multi-Concept Learning
27. Drawing Updates from Derivations
28. Logic Program Synthesis
29. The Application of Inductive Logic Programming to Finite Element Mesh Design
30. Handling Noise in Inductive Logic Programming
31. PAC-Learnability of Determinate Logic Programs
32. An Inference Engine for Multiple Theories
33. The Discovery of the Equator or Concept Driven Learning
34. Inductive Test Case Generation
35. Inducing Temporal Fault Diagnostic Rules from a Qualitative Model
36. Towards Inductive Generalization in Higher Order Logic
37. A framework for Inductive Logic Programming
38. Logic Program Synthesis from Incomplete Specification
39. Language Identification in the Limit
40. Subsumption and Implication
41. Markus—An Optimized Model Inference System
42. Updating Knowledge Bases
43. Updating Knowledge Bases ii
44. Applying Valiant's Learning Framework to AI Concept-Learning Problems
45. Learning Systems of First Order Rules
46. Induction as Nonmonotonic Inference
47. Using Inverse Resolution to Learn Relations from Experiments
48. Generalisation under Implication by Using Or-Introduction
49. Abductive Logic Programming
50. Database Updates Through Abduction
51. Towards Inductive Generalization in Constraint Logic Programs
52. Controlling the Complexity of Learning in Logic Through Syntactic and Task-Oriented Models
53. Incremental and Reversible Acquisition of Taxonomies
54. Some Lower Bounds on the Computational Complexity of Inductive Logic Programming
55. Efficient Learning of Logic Programs with Non-Determinate, Non-Discriminating Literals
56. Drug Design by Machine Learning The Use of Inductive Logic Programming to Model the Structure-Activity Relationships of Trimethoprim Analogues Binding to Dihydrofolate Reductase
57. Refinement Strategies for Inductive Learning of Simple Prolog Programs
58. Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicate Symbols
59. Subsumption and Refinement in Model Inference
60. Constructive Inductive Logic Programming
61. Sub-Unification: A Tool for Efficient Induction of Recursive Programs
62. Logic Program Synthesis and Transformation
63. Learning Non-Recursive Definitions of Relations with LINUS
64. The Use of Background Knowledge in Learning Medical Diagnostic Rules
65. Inventing Necessary Theoretical Terms in Scientific Discovery and Inductive Logic Programming
66. Equivalences of Logic Programs
67. Undecidability of the Horn-Clause Implication Problem
68. Some Global Optimizations for a Prolog Compiler
69. A Theory and Methodology of Inductive Learning
70. Towards a Theory of Types in Prolog
71. Generalisation as Search
72. Constraint-Directed Generalization for Learning Spatial Relations
73. Gedanken-Experiments on Sequential Machines
74. Sloppy Modeling
75. Duce, An Oracle Based Approach to Constructive Induction
76. A Strategy for Constructing New Predicates in First Order Logic
77. Inductive Logic Programming
78. Inverting Implication
79. Predicate Invention and Utility
80. Machine Invention of First-Order Predicates by Inverting Resolution
81. Efficient Induction of Logic Programs
82. Protein Secondary Structure Prediction Using Logic-Based Machine Learning
83. Compression, Significance and Accuracy
84. A Study of Generalisation in Logic Programs
85. Generalization and Learnability: A Study of Constrained Atoms
86. The Utility of Knowledge in Inductive Learning
87. A Further Note on Inductive Generalization
88. A Note on Inductive Generalisation
89. Automatic Methods of Inductive Inference
90. Induction of Decision Trees
91. Determinate Literals in Inductive Logic Programming
92. FOIL: A Midterm Report
93. Inferring Decision Trees Using the Minimum Description Length Principle
94. Learning Logical Definitions from Relations
95. Towards Friendly Concept-Learners
96. Indirect Relevance and Bias in Inductive Concept-Learning
97. Belief Updating from Integrity Constraints and Queries
98. Interactive Concept-Learning and Constructive Induction by Analogy
99. A Unifying Framework for Concept-Learning Algorithms
100. A Theory of Clausal Discovery
101. The Many Faces of Inductive Logic Programming
102. Multiple Predicate Learning
103. Using Interactive Concept-Learning for Knowledge Base Validation and Verification
104. Classes of Recursively Enumerable Sets and Their Decision Problems
105. First Order Theory Revision
106. Modelling by Shortest Data Description
107. A Machine-Oriented Logic Based on the Resolution Principle
108. Extensions of Inversion of Resolution Applied to Theory Completion
109. A Simple and General Solution for Inverting Resolution
110. The Origins of Inductive Logic Programming: A Prehistoric Tale
111. Learning Concepts by Asking Questions
112. Inductive Inference of Theories from Facts
113. Relational Cliches: Constraining Constructive Induction During Relational Learning
114. A Formal Theory of Inductive Inference
115. Two Methods for Improving Inductive Logic Programming Systems
116. Modelling the Structure and Function of Enzymes by Machine Learning
117. A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler
118. Program Construction from Examples
119. Refining a Relational Theory with Multiple Faults in the Concept and Subconcepts
120. A Unifying Representation for Language Restrictions
121. Inverse Resolution of Normal Clauses
122. The Acquisition of Model-Knowledge for a Model-Driven Machine Learning Approach
123. A View Update Translation via Deduction and Annotation
124. Acquisition of Appropriete Bias for Concept Learning
125. A Theory of the Learnable
126. Inductief Afleiden van Logische Regels
127. Induction of Concepts in the Predicate Calculus
128. Learning by Failure to Prove
129. Completing Logic Programs by Inverse Resolution
130. Constraints on Predicate Invention
131. Revising Relational Theories
132. Automatic Representation Adjustment in an Observational Discovery System
133. On the Proper Definition of Minimality in Specialisation and Theory Revision
134. Logic Program Forms