Inductive Logic Programming: Theory and methods

The Journal of Logic Programming - Tập 19 - Trang 629-679 - 1994
Stephen Muggleton, Luc de Raedt

Tài liệu tham khảo

Adé, 1993, Theory revision, Proceedings of the 3rd International Workshop on Inductive Logic Programming, 179 Ali, 1993, Hydra: A Noise Tolerant Relational Concept-Learning Algorithm Angluin, 1978, On the Complexity of Minimum Inference of Regular Sets, Information and Control, 39, 337, 10.1016/S0019-9958(78)90683-6 Banerji, 1987, Learning in the Limit in a Growing Language, 280 Banerji, 1992, Learning Theoretical Terms Baroglio, 1992, Learning Mutually Dependent Relations, Journal of Intelligent Information Systems, 2 Bell, 1993, On the Close Relationship Between FOIL and the Frameworks of Helft and Plotkin, Proceedings of the 3rd International Workshop on Inductive Logic Programming, 1 Bergadano, 1993, Towards an Inductive Logic Programming Language Bergadano, 1988, Concept Acquisition in Noisy Environments, IEEE Transactions on Pattern Analysis and Machine Intelligence, 10, 555, 10.1109/34.3917 Bergadano, 1993, An Interactive System to Learn Functional Logic Programs Biermann, 1986, Fundamental Mechanisms in Machine Learning and Inductive Inference Biermann, 1978, The Inference of Regular LISP Programs from Examples, IEEE Transactions on Systems, Man, and Cybernetics, 8, 585, 10.1109/TSMC.1978.4310035 Biermann, 1972, On the Synthesis of Finite-State Machines from Samples of their Behavior, IEEE Transactions on Computers, C-21, 592, 10.1109/TC.1972.5009015 Biermann, 1976, Constructing Programs from Example Computations, IEEE Transactions on Software Engineering, 2, 10.1109/TSE.1976.233812 Bratko, 1993, Inductive Learning Applied to Program Construction and Verification, Proceedings of the 3rd International Workshop on Inductive Logic Programming, 279 Bratko, 1991, Learning Qualitative Models of Dynamic Systems Brunk, 1991, An Investigation of Noise-Tolerant Relational Concept Learning Algorithms Bruynooghe, 1988, An Instance of Abstract Interpretation Integrating Type and Mode Inferencing, Proceedings of the 5th International Conference and Symposium on Logic Programming, 669 Bry, 1990, Intensional Updates: Abduction via Deduction, 561 Buntine, 1987, Induction of Horn-Clauses: Methods and the Plausible Generalization Algorithm, International Journal of Man-Machine Studies, 26, 499, 10.1016/S0020-7373(87)80084-6 Buntine, 1988, Generalised Subsumption and Its Applications to Induction and Redundancy, Artificial Intelligence, 36, 149, 10.1016/0004-3702(88)90001-X Carnap, 1952 Cohen, 1992, Compiling Knowledge into an Explicit Bias Cohen, 1994, Grammatically Biased Learning: Learning Logic Programs Using an Explicit Antecedent Description Language, Artificial Intelligence, 10.1016/0004-3702(94)90070-1 Cohen, 1993, Learnability of Restricted Logic Programs, Proceedings of the 3rd International Workshop on Inductive Logic Programming, 41 Cohen, 1993, PAC-Learning a Restricted Class of Recursive Logic Programs, Proceedings of the 3rd International Workshop on Inductive Logic Programming, 73 Conklin, 1992 Datta, 1993, Concept-Sharing: A Means to Improve Multi-Concept Learning Decker, 1990, Drawing Updates from Derivations, 470 Deville, 1993, Logic Program Synthesis, Journal of Logic Programming Dolsak, 1992, The Application of Inductive Logic Programming to Finite Element Mesh Design Džeroski, 1992, Handling Noise in Inductive Logic Programming, Proceedings of the 2nd International Workshop on Inductive Logic Programming Džeroski, 1992, PAC-Learnability of Determinate Logic Programs, Proceedings of the 5th ACM Workshop on Computational Learning Theory Emde, 1989, An Inference Engine for Multiple Theories, vol. 347 Emde, 1983, The Discovery of the Equator or Concept Driven Learning, 455 Bergadano, 1993, Inductive Test Case Generation, Proceedings of the 3rd International Workshop on Inductive Logic Programming, 11 Feng, 1992, Inducing Temporal Fault Diagnostic Rules from a Qualitative Model Muggleton, 1992, Towards Inductive Generalization in Higher Order Logic Flach, 1992, A framework for Inductive Logic Programming Flener, 1993, Logic Program Synthesis from Incomplete Specification, Journal of Symbolic Computation, 15, 775, 10.1016/S0747-7171(06)80012-X Gold, 1967, Language Identification in the Limit, Information and Control, 10, 447, 10.1016/S0019-9958(67)91165-5 Gottlob, 1987, Subsumption and Implication, Information Processing Letters, 24, 109, 10.1016/0020-0190(87)90103-7 Grobelnik, 1992, Markus—An Optimized Model Inference System, Proceedings of the ECAI Workshop on Logical Approaches to Machine Learning Guessoum, 1990, Updating Knowledge Bases, New Generation Computing, 8, 71, 10.1007/BF03037514 Guessoum, 1992, Updating Knowledge Bases ii, New Generation Computing, 10, 73, 10.1007/BF03037523 Haussler, 1990, Applying Valiant's Learning Framework to AI Concept-Learning Problems, vol. 3, 641 Helft, 1988, Learning Systems of First Order Rules, 395 Helft, 1989, Induction as Nonmonotonic Inference, 149 Hume, 1991, Using Inverse Resolution to Learn Relations from Experiments, 412 Idestam-Almquist, 1993, Generalisation under Implication by Using Or-Introduction, vol. 667, 56 Kakas, 1992, Abductive Logic Programming, Journal of Logic and Computation, 2, 10.1093/logcom/2.6.719 Kakas, 1990, Database Updates Through Abduction, 650 Kawamura, 1993, Towards Inductive Generalization in Constraint Logic Programs, Proceedings of the IJCAI Workshop on Inductive Logic Programming Kietz, 1992, Controlling the Complexity of Learning in Logic Through Syntactic and Task-Oriented Models Kietz, 1988, Incremental and Reversible Acquisition of Taxonomies, Proceedings of the 2nd European Knowledge Acquisition for Knowledge Based Systems Workshops Kietz, 1993, Some Lower Bounds on the Computational Complexity of Inductive Logic Programming, vol. 667, 115 Kijsirikul, 1992, Efficient Learning of Logic Programs with Non-Determinate, Non-Discriminating Literals King, 1992, Drug Design by Machine Learning: The Use of Inductive Logic Programming to Model the Structure-Activity Relationships of Trimethoprim Analogues Binding to Dihydrofolate Reductase, Proceedings of the National Academy of Sciences, 89, 10.1073/pnas.89.23.11322 Kirschenbaum, 1991, Refinement Strategies for Inductive Learning of Simple Prolog Programs Kleene, 1952, Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicate Symbols van der Laag, 1993, Subsumption and Refinement in Model Inference, vol. 667, 95 Lapointe, 1993, Constructive Inductive Logic Programming, Proceedings of the 3rd International Workshop on Inductive Logic Programming Lapointe, 1992, Sub-Unification: A Tool for Efficient Induction of Recursive Programs 1993, Logic Program Synthesis and Transformation Lavrač, 1993 Lavrač, 1991, Learning Non-Recursive Definitions of Relations with LINUS, vol. 482 Lavrač, 1993, The Use of Background Knowledge in Learning Medical Diagnostic Rules, Applied Artificial Intelligence, 7, 273, 10.1080/08839519308949989 Ling, 1991, Inventing Necessary Theoretical Terms in Scientific Discovery and Inductive Logic Programming Maher, 1986, Equivalences of Logic Programs Marcinkowski, 1992, Undecidability of the Horn-Clause Implication Problem, Proceedings of the 33rd IEEE Annual Symposium on the Foundations of Computer Science, 354, 10.1109/SFCS.1992.267755 Mellish, 1985, Some Global Optimizations for a Prolog Compiler, Journal of Logic Programming, 2, 43, 10.1016/0743-1066(85)90004-4 Michalski, 1983, A Theory and Methodology of Inductive Learning, 83 Mishra, 1984, Towards a Theory of Types in Prolog, 289 Mitchell, 1982, Generalisation as Search, Artificial Intelligence, 18, 203, 10.1016/0004-3702(82)90040-6 Mizoguchi, 1992, Constraint-Directed Generalization for Learning Spatial Relations, Proceedings of the Second Inductive Logic Programming Workshop Moore, 1956, Gedanken-Experiments on Sequential Machines, 129 Morik, 1989, Sloppy Modeling, vol. 347 Mortimer, 1988 Muggleton, 1987, Duce, An Oracle Based Approach to Constructive Induction, 287 Muggleton, 1988, A Strategy for Constructing New Predicates in First Order Logic, 123 Muggleton, 1991, Inductive Logic Programming, New Generation Computing, 8, 295, 10.1007/BF03037089 1991 1992 1992 Muggleton, 1994, Inverting Implication, Artificial Intelligence Journal Muggleton, 1994, Predicate Invention and Utility, Journal of Experimental and Theoretical Artificial Intelligence, 6, 127, 10.1080/09528139408953784 1993 Muggleton, S., Mode-Directed Inverse Resolution, in: K. Furukawa, D. Michie, and S. Muggleton (eds.), Machine Intelligence 14, Oxford University Press (to appear). Muggleton, 1988, Machine Invention of First-Order Predicates by Inverting Resolution, 339 Muggleton, 1990, Efficient Induction of Logic Programs Muggleton, 1992, Protein Secondary Structure Prediction Using Logic-Based Machine Learning, Protein Engineering, 5, 647, 10.1093/protein/5.7.647 Muggleton, 1992, Compression, Significance and Accuracy Niblett, 1988, A Study of Generalisation in Logic Programs Page, 1992, Generalization and Learnability: A Study of Constrained Atoms Pazzani, 1992, The Utility of Knowledge in Inductive Learning, Machine Learning, 9, 10.1007/BF00993254 Pereira, 1989 1991 Plotkin, 1971, A Further Note on Inductive Generalization, vol. 6 Plotkin, 1970, A Note on Inductive Generalisation, 153 Plotkin, 1971, Automatic Methods of Inductive Inference Quinlan, 1986, Induction of Decision Trees, Machine Learning, 1, 81, 10.1007/BF00116251 Quinlan, 1991, Determinate Literals in Inductive Logic Programming, 746 Quinlan, 1993, FOIL: A Midterm Report, vol. 667, 3 Quinlan, 1989, Inferring Decision Trees Using the Minimum Description Length Principle, Information and Computation, 80, 227, 10.1016/0890-5401(89)90010-2 Quinlan, 1990, Learning Logical Definitions from Relations, Machine Learning, 5, 239, 10.1007/BF00117105 De Raedt, 1992 De Raedt, 1992 De Raedt, 1989, Towards Friendly Concept-Learners, 849 De Raedt, 1990, Indirect Relevance and Bias in Inductive Concept-Learning, Knowledge Acquisition, 2, 365, 10.1016/S1042-8143(05)80014-7 De Raedt, 1992, Belief Updating from Integrity Constraints and Queries, Artificial Intelligence, 53, 291, 10.1016/0004-3702(92)90075-9 De Raedt, 1992, Interactive Concept-Learning and Constructive Induction by Analogy, Machine Learning, 8, 107, 10.1007/BF00992861 De Raedt, 1992, A Unifying Framework for Concept-Learning Algorithms, The Knowledge Engineering Review, 7, 251, 10.1017/S0269888900006366 De Raedt, 1993, A Theory of Clausal Discovery De Raedt, 1993, The Many Faces of Inductive Logic Programming De Raedt, 1993, Multiple Predicate Learning De Raedt, 1991, Using Interactive Concept-Learning for Knowledge Base Validation and Verification, 177 Rice, 1953, Classes of Recursively Enumerable Sets and Their Decision Problems, Transactions of the American Mathematical Society, 83 Richards, 1991, First Order Theory Revision, 447 Rissanen, 1978, Modelling by Shortest Data Description, Automatica, 14, 465, 10.1016/0005-1098(78)90005-5 Robinson, 1965, A Machine-Oriented Logic Based on the Resolution Principle, JACM, 12, 23, 10.1145/321250.321253 Rouveirol, 1992, Extensions of Inversion of Resolution Applied to Theory Completion Rouveirol, 1989, A Simple and General Solution for Inverting Resolution, 201 Sammut, 1993, The Origins of Inductive Logic Programming: A Prehistoric Tale, Proceedings of the 3rd International Workshop on Inductive Logic Programming, 127 Sammut, 1986, Learning Concepts by Asking Questions, Vol. 2, 167 Shapiro, 1983 Shapiro, 1991, Inductive Inference of Theories from Facts Silvertein, 1989, Relational Cliches: Constraining Constructive Induction During Relational Learning Solomonoff, 1964, A Formal Theory of Inductive Inference, Information and Control, 7, 376 Stahl, 1992 Stahl, 1993, Two Methods for Improving Inductive Logic Programming Systems, Proceedings of the 6th European Conference on Machine Learning, vol. 667 Sternberg, 1992, Modelling the Structure and Function of Enzymes by Machine Learning, Proceedings of the Royal Society of Chemistry: Faraday Discussions, 93, 269 Stickel, 1988, A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler, Journal of Automated Reasoning, 4, 353, 10.1007/BF00297245 Summers, 1975, Program Construction from Examples Tankitvanitch, 1992, Refining a Relational Theory with Multiple Faults in the Concept and Subconcepts, 436 Tausend, 1993, A Unifying Representation for Language Restrictions, Proceedings of the 3rd International Workshop on Inductive Logic Programming Taylor, 1993, Inverse Resolution of Normal Clauses, Proceedings of the 3rd International Workshop on Inductive Logic Programming, 165 Thieme, 1989, The Acquisition of Model-Knowledge for a Model-Driven Machine Learning Approach Tomasic, 1988, A View Update Translation via Deduction and Annotation, vol. 326, 338 Utgoff, 1982, Acquisition of Appropriete Bias for Concept Learning, 414 Valiant, 1984, A Theory of the Learnable, Communications of the ACM, 27, 1134, 10.1145/1968.1972 Van Laer, 1993, Inductief Afleiden van Logische Regels Vere, 1975, Induction of Concepts in the Predicate Calculus, 282 Wirth, 1988, Learning by Failure to Prove, 237 Wirth, 1989, Completing Logic Programs by Inverse Resolution, 239 Wirth, 1991, Constraints on Predicate Invention, 457 Wogulis, 1991, Revising Relational Theories, 462 Wrobel, 1988, Automatic Representation Adjustment in an Observational Discovery System, 253 Wrobel, 1993, On the Proper Definition of Minimality in Specialisation and Theory Revision, vol. 667, 65 Yokomori, 1986, Logic Program Forms, New Generation Computing, 4, 10.1007/BF03037409