Abstract
In the last decade, many efforts have been devoted to the exploration of techniques for learning and refining first order theories, as the necessary step for applying machine learning methodologies to real world applications. In this paper, we present a new approach to the integration of inductive and deductive learning techniques that seems to overcome some of the limitations of existing learning systems without imposing strong constraints or biases on both the representation language and the search space. In particular, a new search structure that enables the system to learn a structured knowledge base is proposed. Moreover, the learning system described in the paper can be used both to learn new knowledge from scratch and to refine an existing background theory.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.R., Blair, H.A., and Walker, A. “Towards a Theory of Declarative Knowledge”, in Foundations of Deductive Databases and Logic Programming, Minker, J. (Ed), Morgan Kaufmann, Los Altos, CA, 89–148, 1988.
Baroglio, C., Botta, M., and Giordana, A. “Learning Relations: An Evaluation of Search Strategies”, Fundamenta Informaticae, 18, No. 2,3,4, 221–232, Feb.–Apr., 1993.
Botta, M. and Giordana, A. “Smart+: A MultiStrategy Learning Tool”, Proc. of the IJCAI-93, Chambery, France, August, 937–943, 1993.
Clark, K. “Negation as Failure”, in Logic and Data Bases, Gallaire, H. and Minker, J. (Eds), Plenum Press, New York, 275–295, 1978.
De Raedt, L. and Bruynooghe, M. “Towards Friendly Concept-Learners”, Proc. of the IJCAI-91, Sidney, Australia, 849–854, 1991.
De Raedt, L., Lavrač, N., and DŽeroski, S. “Multiple Predicate Learning”, Proc. of the IJCAI-93, Chambery, France, 1037–1042, 1993.
Feldman, R., Segre, A., and Koppel, M. “Incremental Refinement of Approximate Domain Theories”, Proc. of the Eigth International Workshop on Machine Learning, Evanston, IL, 500–504, 1991.
Fisher, D., Subramanian, D., and Tadepalli, P. (Eds). Proceedings of the Third International Workshop on Knowledge Compilation and Speedup Learning. Amherst, MA, 1993.
Forgy, C.L. “RETE: A Fast Algorithm for the many Pattern/many Object Pattern Match Problem”, Artificial Intelligence, 19, 17–37, 1982.
Ginsberg, A. “Theory Revision via Prior Operationalization”, Proc. of the AAAI-88, Saint Paul, MN, 590–595, 1988.
Giordana, A. and Saitta, L. “REGAL: An Integrated System for Learning Relations using Genetic Algorithms”, Proc. of the Second International Workshop on MultiStrategy Learning, Harpers Ferry, WV, 234–249, 1993.
Lavrač, N., DŽeroski, S., and Grobelnik, M. “Learning non-recursive definitions of relations with LINUS”, Proc. of the EWSL-91, LNAI 482, Springer-Verlag, Porto, Portugal, 1991.
Michalski, R.S. “Pattern recognition as a rule-guided inductive inference”, IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-2, 349–361, 1980.
Mitchell, T., Keller, R., and Kedar-Cabelli, S. “Explanation Based Generalization: A Unifying View”, Machine Learning, 1, 47–80, 1986.
Mooney, R.J. and Ourston, D. “A Multistrategy Approach to Theory Refinement”, in Machine Learning: A Multistrategy Approach, Vol. IV, Michalski, R.S. and Tecuci, G. (Eds), Morgan Kaufmann, San Francisco, CA, 141–164, 1994.
Muggleton, S. and Feng, C. “Efficient Induction of Logic Programs”, Proc. of the First Conference on Algorithmic Learning Theory, Tokyo, Japan, 1990.
Pazzani, M.J. and Kibler, D. “The Utility of Knowledge in Inductive Learning”, Machine Learning, 9, 57–94, 1992.
Pazzani, M.J. and Brunk, C. “Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning”, Proc. of the AAAI-93, Washington, D.C., 328–334, 1993.
Quinlan, R. “Learning Logical Definitions from Relations”, Machine Learning, 5, 239–266, 1990.
Reiter, R. “On Closed World Data Bases”, in Logic and Data Bases, Gallaire, H. and Minker, J. (Eds), Plenum Press, New York, NY, 55–76, 1978.
Richards, B. and Mooney, R. “First-Order Theory Revision”, Proc. of the Eight International Workshop on Machine Learning, Evanston, IL, 447–451, 1991.
Saitta, L., Botta, M., and Neri, F. “Multi-strategy learning and theory revision”, Machine Learning, 11, 153–172, 1993.
Shapiro, E.Y. Algorithmic Program Debugging, The MIT Press, 1983.
Tecuci, G. and Duff, D. “Knowledge Base Refinement Through a Supervised Validation of Plausible Reasoning”, Proc. of the Second International Workshop on MultiStrategy Learning, Harpers Ferry, WV, 76–91, 1993.
Wogulis, J. and Pazzani, M. “A Methodology for Evaluating Theory Revision Systems: Results with Audrey II”, Proc. of the IJCAI-93, Chambery, France, 1128–1134, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Botta, M. (1994). Learning first order theories. In: Raś, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1994. Lecture Notes in Computer Science, vol 869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58495-1_36
Download citation
DOI: https://doi.org/10.1007/3-540-58495-1_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58495-7
Online ISBN: 978-3-540-49010-4
eBook Packages: Springer Book Archive