Abstract
This paper presents an integration of induction and abduction in INTHELEX, a prototypical incremental learning system. The refinement operators perform theory revision in a search space whose structure is induced by a quasi-ordering, derived from Plotkin's θ-subsumption, compliant with the principle of Object Identity. A reduced complexity of the refinement is obtained, without a major loss in terms of expressiveness. These inductive operators have been proven ideal for this search space. Abduction supports the inductive operators in the completion of the incoming new observations. Experiments have been run on a standard dataset about family trees as well as in the domain of document classification to prove the effectiveness of such multistrategy incremental learning system with respect to a classical batch algorithm.
Article PDF
Similar content being viewed by others
References
Becker, J.M. (1985). Inductive learning of decision rules with exceptions: methodology and experimentation. B.S. diss., UIUCDCS-F–85–945, Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois.
Bergadano, F. & Gunetti, D. (1994). Learning clauses by tracing derivations. In S. Wrobel (Ed.), Proceedings of the 4th International Workshop on Inductive Logic Programming, ILP-94 (pp.1–29).
Botta, M. (1994). Learning first order theories. In Z.W. Ras & M. Zemankova (Eds.), Methodologies for Intelligent Systems, Lecture Notes in Artificial Intelligence (Vol. 869: pp. 356–365). Springer-Verlag.
Cain, T. (1991). The Ductor: a theory revision system for propositional domains. Proceedings of the Eighth International Workshop on Machine Learning (pp. 485–489). San Mateo, CA: Morgan Kaufmann).
Ceri, S., Gottlob, G., & Tanca, L. (1990). Logic programming and databases. Springer-Verlag.
Clark, K. L. (1978). Negation as failure. In H. Gallaire & J. Minker (Eds.), Logic and databases, Plenum Press.
De Raedt, L. (1992). Interactive theory revision—an inductive logic programming approach. AP.
Dimopoulos, Y. & Kakas, A. (1996) Abduction and learning. In L. De Raedt (Ed.), Advances in inductive programming (pp. 144–171). IOS Press.
Esposito, F., Malerba, D., & Semeraro, G. (1992). Classification in noisy environments using a distance measure between structural symbolic descriprions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14, 390–402.
Esposito, F., Malerba, D., & Semeraro, G. (1994). Multistrategy learning for document recognition. Applied Artificial Intelligence: An International Journal, 8, 33–84.
Esposito, F., Laterza, A., Malerba, D., & Semeraro, G. (1996a). Locally Finite, Proper and complete operators for refining datalog programs. In Z.W. Ras & M. Michalewicz (Eds.), Lecture Notes in Artificial Intelligence (Vol. 1079: Foundations of Intelligent Systems) (pp. 468–478) Springer.
Esposito, F., Lamma, E., Malerba, D., Mello, P., Milano, M., Riguzzi, F., & Semeraro, G. (1996b). Learning abductive logic programs. ECAI 96 Workshop on Abductive and Inductive Reasoning, Workshop Notes (pp. 23–30).
Ginsberg, A. (1990). Theory reduction, theory revision, and retranslation. Proceedings of the 8th National Conference on Artificial Intelligence (AAAI-90) (pp. 777–782).
Hayes-Roth, F. & McDermott, J. (1978). An interference matching technique for inducing abstractions. Communications of the ACM, 21, 401–410.
Helft, N. (1987). Inductive Generalization: A logical framework. In I. Bratko & N. Lavrac (Eds.), Progress in machine learning-proceedings of EWSL 87: 2nd European Working Session on Learning (pp. 149–157). Wilmslow: Sigma Press.
Josephson, J. R. & Josephson, S. G. (Eds.), (1996). Abductive inference. Cambridge University Press.
Kakas, A. C. & Mancarella, P. (1990). On the relation of truth maintenance and abduction. Proceedings of the 1st Pacific Rim International Conference on Artificial Intelligence, PRICAI 90, Nagoya, Japan.
Kanellakis, P. C. (1990). Elements of relational database theory. In J. Van Leeuwen (Ed.), Handbook of Theoretical Computer Science (Volume B, Formal Models and Semantics, pp. 1073–1156). Elsevier Science Publishers.
Komorowski, J. & Trcek, S. (1994). Towards refinement of definite logic programs. In Z.W. Ras& M. Zemankova (Eds.), Lecture Notes in Artificial Intelligence (Vol. 869: Methodologies for Intelligent Systems). (pp. 315–325) Springer-Verlag.
Lamma, E., Mello, P., Milano, M., Riguzzi, F., Esposito, F., Ferilli, S., & Semeraro, G. (2000). Cooperation of abduction and induction in logic programming. Abductive and Inductive Reasoning: Essays on their Relation and Integration. Kluwer.
Lloyd, J. W. (1987). Foundations of logic programming 2nd edn. Springer-Verlag.
Malerba, D., Esposito, F., & Lisi, F. A. (1998). Learning recursive theories with ATRE. Proceedings of 13th European Conference on Artificial Intelligence, Brighton (pp. 435–439). John Wiley & Sons.
Matwin, S. & Plante, B. (1991). A deductive-inductive method for theory revision. Proceedings of the 1st International Workshop on Multistrategy Learning, Harper's Ferry, WVA (pp. 160–174). GMU Press.
Mooney, R. & Ourston, D. (1994) A multistrategy approach to theory refinement. In R. S. Michalski & G. Tecuci (Eds.), Machine learning: a multistrategy approach (Vol. 4), pp. 141–164 San Mateo, CA: Morgan Kaufman.
Mooney, R. (1995) A preliminary PAC analysis of theory revision. In T. Petsche, S. J. Hanson, & J. Shavlik (Eds.), Computational learning theory and machine learning systems. (Vol. 3, pp. 43–53), MIT Press.
Muggleton, S. (1987). Duce, an Oracle based approach to constructive induction. Proceedings of the 10th International Joint Conference on Artificial Intelligence, IJCAI87 (pp. 287–292).
Plotkin, G. D. (1970). A note on inductive generalization. In B. Meltzer & D. Michie (Eds.), Machine Intelligence (Vol. 5, pp. 153–163). Edinburgh University Press.
Plotkin, G. D. (1972). Building-in equational theories. In B. Meltzer & D. Michie (Eds.), Machine Intelligence, (Vol. 7, pp. 73–90). Edinburgh University Press.
Reinke, R. E. & Michalski, R. S. (1985). Incremental learning of concept descriptions: a method and experimental results. In D. Michie (Ed.), Machine Intelligence, (Vol. 11). Edinburgh University Press.
Richards, B. L. & Mooney, R. J. (1991). First-order theory revision. Proceedings of the 8th InternationalWorkshop on Machine Learning (pp. 447–451).
Richards, B. L. & Mooney, R. J. (1995). Refinement of first-order Horn-clause domain theories. Machine Learning, 19(2), 95–131.
Saitta, L., Botta, M., & Neri, F. (1993). Multistrategy learning and theory revision. Machine Learning, 11, 153–172.
Semeraro, G., Esposito, F., Fanizzi, N., & Malerba, D. (1995). Revision of logical theories. In M. Gori & G. Soda (Eds.), LECTURE NOTES in ARTIFICIAL INTELLIGENCE. (Vol 992: Topics in Artificial Intelligence), pp. 365–376. Springer-Verlag.
Semeraro, G., Esposito, F., Malerba, D., Fanizzi, N., & Ferilli, S. (1998). A logic framework for the Incremental Inductive Synthesis of Datalog Theories. In N. E. Fuchs (Ed.), Proceedings of the 7th International Workshop on Logic Program Synthesis and Transformation (pp. 300–321). Lecture Notes in Computer Science (Vol. 1463), Springer-Verlag.
Shapiro, E. Y. (1983). Algorithmic program debugging. MIT Press.
van der Laag, P. R. J. & Nienhuys-Cheng, S.-H. (1994). Existence and nonexistence of complete refinement operators. In F. Bergadano & L. De Raedt (Eds.), Machine Learning: ECML-94-Proceedings of the European Conference on Machine Learning (pp. 307–322). LECTURE NOTES in ARTIFICIAL INTELLIGENCE (Vol. 784), Springer-Verlag.
Vere, S. A. (1975). Induction of concepts in the predicate calculus. Proceedings of the 4th International Joint Conference on Artificial Intelligence, IJCAI-75 (pp. 281–287).
Wogulis, J. (1991). Revising relational domain theories. Proceedings of the 8th International Workshop on Machine Learning (pp. 462–466).
Wrobel, S. (1994). Concept formation and knowledge revision. Kluwer Academic Publishers.
Wrobel, S. (1996). First order theory refinement. In L. De Raedt (Ed.), Advances in Inductive Logic Programming (pp. 14–33). Amsterdam: IOS Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Esposito, F., Semeraro, G., Fanizzi, N. et al. Multistrategy Theory Revision: Induction and Abduction in INTHELEX. Machine Learning 38, 133–156 (2000). https://doi.org/10.1023/A:1007638124237
Issue Date:
DOI: https://doi.org/10.1023/A:1007638124237