Find out how to access previewonly content
Inverse entailment and progol
 Stephen Muggleton
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
This paper firstly provides a reappraisal of the development of techniques for inverting deduction, secondly introduces ModeDirected Inverse Entailment (MDIE) as a generalisation and enhancement of previous approaches and thirdly describes an implementation of MDIE in the Progol system. Progol is implemented in C and available by anonymous ftp. The reassessment of previous techniques in terms of inverse implication leads to new results for learning from positive data and inverting implication between pairs of clauses.
Stephen Muggleton, BSc, PhD., MA(Oxon): He is an EPSRC Advanced Research Fellow at Oxford University Computing Laboratory. He was previously Fujitsu Associate Professor at the University of Tokyo and Director of Academic Research at the Turing Institute, Glasgow. He is author of “Inductive Acquisition of Expert Knowledge”, published by AddisonWesley, and editor of “Inductive Logic Programming”, published by Academic Press and Machine Intelligence 13, published by Oxford University Press. He was chief designer of RuleMaster, which was used by BrainWare to build BMT, the world’s largest expert system. In 1990 he founded the field of Inductive Logic Programming (ILP) and has been Program Chair of three international workshops on this topic. He is Executive Editor of the Machine Intelligence Series, published by Oxford University Press, and lectures on ILP at the Oxford University Computing Laboratory. He is presently developing a computational learning model for ILP called Ulearnability. He has recently published results in the Proceedings of the Royal Society and the Proceedings of the National Academy of Sciences on successful applications of ILP to problems in Molecular Biology.
 Bain, M. and Muggleton, S., “NonMonotonic Learning,” inMachine Intelligence 12 (D. Michie, ed.), Oxford University Press, 1991.
 Bratko, I., Muggleton, S., and Varsek, A., “Learning Qualitative Models of Dynamic Systems,” inProceedings of the Eighth International Machine Learning Workshop, San Mateo, Ca, MorganKaufmann, 1991.
 Clocksin, W.F. and Mellish, C.S.,Programming in Prolog, SpringerVerlag, Berlin, 1981.
 Cohen, W., “Learnability of Restricted Logic Programs,” inProceedings of the 3rd International Workshop on Inductive Logic Programming (S. Muggleton, ed.) (Technical Report IJSDP6707 of the Josef Stefan Institute, Ljubljana, Slovenia), pp. 41–72, 1993.
 Conklin, D. and Witten, I., “ComplexityBased Induction,”Technical Report, Department of Computing and Information Science, Queen’s University, Kingston, Ontario, Canada, 1992.
 Dolsak, B. and Muggleton, S., “The Application of Inductive Logic Programming to Finite Element Mesh Design,” inInductive Logic Programming (S. Muggleton, ed.), Academic Press, London, 1992.
 Dormer, R., “An Inductive Logic Programming Implementation,” MScthesis, Oxford University Computing Laboratory, Oxford, 1993.
 Feng, C., “Inducing Temporal Fault Diagnostic Rules from a Qualitative Model,” inInductive Logic Programming (S. Muggleton, ed.), Academic Press, London, 1992.
 Gillies, D.A., “Confirmation Theory and Machine Learning,” inProceedings of the Second Inductive Logic Programming Workshop, Tokyo,ICOT Technical Report, TM1182, 1992.
 Gold, E.M., “Language Identification in the Lmit,”Information and Control, 10, pp. 447–474, 1967. CrossRef
 Gottlob, G., “Subsumption and Implication,”Information Processing Letters, 24, 2, pp. 109–111, 1987. CrossRef
 Grobelnik, M., “Markus—An Optimized Model Inference System,” inProceedings of the ECAI Workshop on Logical Approaches to Machine Learning, 1992.
 IdestamAlmquist, P., “Learning Missing Clauses by Inverse Resolution,” inProceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, ICOT, pp. 610–617, 1992.
 IdestamAlmquist, P., “Generalization of Clauses”PhD Thesis, Sect. 1, Stockholm univ. 1993.
 Jevons, W.S., “On the Mechanisation of Deductive Inference,”Philosophical Transactions of the Royal Society of London, 160, pp. 497–518, 1870. CrossRef
 Jevons, W.S.,The Principles of Science: A Treatise on Logic and Scientific Method, Macmillan, London, 1874.
 Kakas, A.C., Kowalski, R.A., and Toni, F., “Abductive Logic Programming,”Journal of Logic and Computation, 2, 1992.
 King, R., Muggleton, S., Lewis, R., and Sternberg, M., “Drug Design by Machine Learning: The Use of Inductive Logic Programming to Model the StructureActivity Relationships of Trimethoprim Analogues Binding to Dihydrofolate Reductase,”Proceedings of the National Academy of Sciences, 89, 23, 1992. CrossRef
 Krishnamurthy, V.,Combinatorics: Theory and Applications, Ellis Horwood, Chichester, England, 1986.
 van der Laag, P.R. and NienhuysCheng., “Subsumption and Refinement in Model Inference,” inProceedings of the 6th European Conference on Machine Learning, volume 667 of Lecture Notes in Artificial Intelligence (P. Brazdil, ed.) SpringerVerlag, pp. 95–114, 1993.
 van der Laag, P.R. and NienhuysCheng., “Existence and Nonexistence of Complete Refinement Operators,” inProceedings of the 7th European Conference on Machine Learning (F. Bergadano and L. De Raedt, eds.),volume 784 of Lecture Notes in Artificial Intelligence, SpringerVerlag, pp. 307–322, 1994.
 Lapointe, S. and Matwin, S., “SubUnification: A Tool for Efficient Induction of Recursive Programs,” inProceedings of the Ninth International Machine Learning Conference, Los Altos, Morgan Kaufmann, 1992.
 Lee, C., “A Completeness Theorem and a Computer Program for Finding Theorems Derivable from Given Axioms,”Ph.D. thesis, University of California, Berkeley, 1967.
 Li, M. and Vitanyi, P.,An Introduction to Kolmogorov Complexity and Its Applications, SpringerVerlag, Berlin, 1993.
 Ling, C.X., “Learning the Past Tense of English Verbs: The Symbolic Pattern Associators vs. Connectionist Models,”Journal of Artificial Intelligence Research, 1, pp. 209–229, 1994.
 Lloyd, J.W.,Foundations of Logic Programming, SpringerVerlag, Berlin, 1984.
 Meltzer, B., “Power Amplification for Automatic Theorem Proving,” inMachine Intelligence 5 (B. Meltzer and D. Michie, eds.), Edinburgh University Press, Edinburgh, pp. 165–179, 1969.
 Michalski, R. and Larson, J., “Incremental Generation of vl1 Hypotheses: The Underlying Methodology and the Description of Program AQ11,”ISG 83–5, Computer Science Department, University of Illinois at UrbanaChampaign, 1980.
 Muggleton, S., “Duce, an Oracle Based Approach to Constructive Induction,” inIJCAI87, Kaufmann, pp. 287–292, 1987.
 Muggleton, S., “A Strategy for Constructing New Predicates in First Order Logic,” inProceedings of the Third European Working Session on Learning, Pitman, pp. 123–130, 1988.
 Muggleton, S., “Inductive Logic Programming,”New Generation Computing, 8, 4, pp. 295–318, 1991. CrossRef
 Muggleton, S., “Inverting the Resolution Principle,” inMachine Intelligence 12, Oxford University Press, 1991.
 Muggleton, S., “Inverting Implication,” inProceedings of the Second Inductive Logic Programming Workshop, Tokyo,ICOT Technical Report, TM1182, 1992.
 Muggleton, S., “Bayesian Inductive Logic Programming,” inProceedings of the Eleventh International Machine Learning Conference (W. Cohen and H. Hirsh, eds.), San Mateo, CA, MorganKaufmann, pp. 371–379, 1994.
 Muggleton, S., “Inductive Logic Programming: Derivations, Successes and Shortcomings,”SIGART Bulletin, 5, 1 pp. 5–11, 1994. CrossRef
 Muggleton, S., “Predicate Invention and Utilization,”Journal of Experimental and Theoretical Artificial Intelligence, 6, 1, pp. 127–130, 1994. CrossRef
 Muggleton, S. and Buntine, W., “Machine Invention of FirstOrder Predicates by Inverting Resolution,” inProceedings of the Fifth International Conference on Machine Learning, Kaufmann, pp. 339–352, 1988.
 Muggleton, S. and Feng, C., “Efficient Induction of Logic Programs,” inProceedings of the First Conference on Algorithmic Learning Theory, Tokyo, Ohmsha, 1990.
 Muggleton, S., King, R., and Sternberg, M., “Protein Secondary Structure Prediction Using LogicBased Machine Learning,”Protein Engineering, 5, 7, pp. 647–657, 1992. CrossRef
 Muggleton, S. and Page, C.D., “SelfSaturation of Definite Clauses,” inProceedings of the Fourth International Inductive Logic Programming Workshop, (S. Wrobel, ed.) Gesellschaft für Mathematik und Datenverarbeitung MBH, pp. 161–174, 1994.GMDStudien Nr 237.
 Muggleton, S. and Page, D., “Beyond First Order Learning: Inductive Learning with HigherOrder Logic,”Technical Report, PRGTR1394, Oxford University Computing Laboratory, Oxford, 1994.
 Muggleton, S. and Page, D., “A Learnability Model for Universal Representations,”Technical Report, PRGTR394, Oxford University Computing Laboratory, Oxford, 1994.
 Muggleton, S. and De Raedt, L., “Inductive Logic Programming: Theory and Methods,”Journal of Logic Programming, 19, 20, pp. 629–679, 1994. CrossRef
 Muggleton, S., Srinivasan, A., and Bain, M., “Compression, Significance and Accuracy,” inProceedings of the Ninth International Machine Learning Conference (D. Sleeman and P. Edwards, eds.), San Mateo, CA, MorganKaufmann, pp. 338–347, 1992.
 Nilsson, N.J.,Principles of Artificial Intelligence, Tioga, Palo Alto, CA, 1980.
 Plotkin, G.D., “A Note on Inductive Generalisation,” inMachine Intelligence 5 (B. Meltzer and D. Michie, eds.), Edinburgh University Press, Edinburgh, pp. 153–163, 1969.
 Plotkin, G.D., “Automatic Methods of Inductive Inference,”Ph.D thesis, Edinburgh University, August 1971.
 Popplestone, R.J., “An Experiment in Automatic Induction,” inMachine Intelligence 5 (B. Meltzer and D. Michie, eds.), Edinburgh University Press, Edinburgh, pp. 203–215, 1969.
 Quinlan, J.R., “Learning Logical Definitions from Relations,”Machine Learning, 5, pp. 239–266, 1990.
 Quinlan, J.R., “Past Tenses of Verbs and FirstOrder Learning,” inProceedings of the 7th Australian Joint Conference on Artificial Intelligence (C. Zhang, J. Debenham, and D. Lukose, eds.), Singapore, World Scientific, pp. 13–20, 1993.
 Reynolds, J.C., “Transformational Systems and the Algebraic Structure of Atomic Formulas,” inMachine Intelligence 5 (B. Meltzer and D. Michie, eds.), Edinburgh University Press, Edinburgh, pp. 135–151, 1969.
 Rissanen, J., “Modeling by Shortest Data Description,”Automatica, 14, pp. 465–471, 1978. CrossRef
 Robinson, J.A., “A MachineOriented Logic Based on the Resolution Principle,”JACM, 12, 1, pp. 23–41, January 1965. CrossRef
 Rouveirol, C., “Extensions of Inversion of Resolution Applied to Theory Completion,” inInductive Logic Programming (S. Muggleton, ed.), Academic Press, London, 1992.
 Rouveirol C. and Puget, JF., “A Simple and General Solution for Inverting Resolution,” inEWSL89, London, Pitman, pp. 201–210, 1989.
 Shannon, C.E. and Weaver, W.,The Mathematical Theory of Communication, University of Illinois Press, Urbana, 1963.
 Shapiro, E.Y.,Algorithmic Program Debugging, MIT Press, 1983.
 Srinivasan, A., Muggleton, S.H., King, R.D., and Sternberg, M.J.E., “Mutagenesis; ILP Experiments in a NonDeterminate Biological Domain,” inProceedings of the Fourth International Inductive Logic Programming Workshop (S. Wrobel, ed.), Gesellschaft für Mathematik und Datenverarbeitung MBH, 1994.GMDStudien Nr 237.
 Srinivasan, A., Muggleton, S.H., King, R.D., and Sternberg, M.J.E., “The Effect of Background Knowledge in Inductive Logic Programming: A Case Study,”Technical Report, PRGTR995, Oxford University Computing Laboratory, Oxford, 1995.
 Srinivasan, A., Muggleton, S.H., King, R.D., and Sternberg, M.J.E., “Theories for Mutagenicity: A Study of FirstOrder and Feature Based Induction,”Technical Report, PRGTR895, Oxford University Computing Laboratory, Oxford, 1995.
 Wirth, R., “Completing Logic Programs by Inverse Resolution,” inEWSL89, London, Pitman, pp. 239–250, 1989.
 Title
 Inverse entailment and progol
 Journal

New Generation Computing
Volume 13, Issue 34 , pp 245286
 Cover Date
 19951201
 DOI
 10.1007/BF03037227
 Print ISSN
 02883635
 Online ISSN
 18827055
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Learning
 Logic Programming
 Induction
 Predicate Invention
 Inverse Resolution
 Inverse Entailment
 Information Compression
 Industry Sectors
 Authors

 Stephen Muggleton ^{(1)}
 Author Affiliations

 1. Oxford University Computing Laboratory, Wolfson Building, Parks Rood, OX1 3QD, Oxford, UK