Skip to main content
SpringerLink
Log in

Inference of abduction theories for handling incompleteness in first-order learning

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

In real-life domains, learning systems often have to deal with various kinds of imperfections in data such as noise, incompleteness and inexactness. This problem seriously affects the knowledge discovery process, specifically in the case of traditional Machine Learning approaches that exploit simple or constrained knowledge representations and are based on single inference mechanisms. Indeed, this limits their capability of discovering fundamental knowledge in those situations. In order to broaden the investigation and the applicability of machine learning schemes in such particular situations, it is necessary to move on to more expressive representations which require more complex inference mechanisms. However, the applicability of such new and complex inference mechanisms, such as abductive reasoning, strongly relies on a deep background knowledge about the specific application domain. This work aims at automatically discovering the meta-knowledge needed to abduction inference strategy to complete the incoming information in order to handle cases of missing knowledge.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blockeel H, De Raedt L (1996) Inductive database design. In: Proceedings of the 10th international symposium on methodologies for intelligent systems (ISMIS96), vol 1079 of Lecture Notes in Artificial Intelligence, Springer-Verlag, pp 376–385

  2. Cestnik B, Kononenko I, Bratko I (1987) Assistant 86: A knowledge-elicitation tool for sophisticated users. In: Proceedings of EWSL, Sigma Press. Bled, Yugoslavia, pp 31–45

  3. Clark K (1978) Negation as failure. In: Gallaire H, Minker J (eds) Logic and databases, Plenum Press, New York, pp 293–322

  4. Clark P, Boswell R (1991) Rule induction with CN2: Some recent improvements. In: Proceedings of the fifth European working session on learning, Springer, Berlin Heidelberg New York, pp 151–163

  5. Cohen P, Feigenbaum E (eds) (1981) The Handbook of artificial intelligence. vol 3. Morgan Kaufmann, San Mateo, CA

    Google Scholar 

  6. De Raedt L (1992) Interactive theory revision—an inductive logic programming approach. Academic Press, New York

    Google Scholar 

  7. Dimopoulos Y, Kakas A (1996) Abduction and learning. In: Raedt LD (ed) Advances in inductive logic programming, IOS Press, pp 144–171

  8. Eshghi K, Kowalski R (1989) Abduction compared to negation by failure. In: Levi G, Martelli M (eds) Proceedings of the 6th international conference on logic programming, The MIT Press, Cambridge, MA, pp 234–255

  9. Esposito F, Ferilli S, Fanizzi N, Basile T, Di Mauro N (2003) Incremental multistrategy learning for document processing. Appl Artif Intell: An Int J 17(8–9):859–883

    Google Scholar 

  10. Esposito F, Lamma E, Malerba D, Mello P, Milano M, Riguzzi F, Semeraro G (1996) Learning abductive logic programs. In: Proceedings of the ECAI96 workshop on abductive and inductive reasoning, Budapest, Hungary, pp 23–30

  11. Esposito F, Malerba D, Lisi F (2000a) Machine learning for intelligent processing of printed documents. J Intell Inf Syst 14(2–3):175–198

    Article  Google Scholar 

  12. Esposito F, Semeraro G, Fanizzi N, Ferilli S (2000b) Multistrategy theory revision: induction and abduction in INTHELEX. Machine Learn 38(1–2):133–156

    Article  MATH  Google Scholar 

  13. Ferilli S, Esposito F, Basile T, Di Mauro N (2004) Automatic induction of first-order logic descriptors type domains from observations. In: Camacho R, King RD, Srinivasan A (eds) ILP, vol 3194 of LNCS, Springer, Berlin Heidelberg New York, pp 116–131

  14. Flach P, Lachiche N (2001) Confirmation-guided discovery of first-order rules with Tertius. Machine Learn 42(1–2):61–95

    Article  MATH  Google Scholar 

  15. Hewett R, Leuchner J (2002) Knowledge discovery with second-order relations. Knowledge Inf Syst 4(4):413–439

    Article  Google Scholar 

  16. Hinneburg A, Keim D (2003) A general approach to clustering in large databases with noise. Knowledge Inf Syst 5(4):387–415

    Article  Google Scholar 

  17. Kakas A, Mancarella P (1990) On the relation of truth maintenance and abduction. In: Proceedings of the 1st pacific rim international conference on artificial intelligence, Nagoya, Japan

  18. Kakas A, Riguzzi F (1999) Abductive concept learning. New Gen Comput

  19. Kakas A, Kowalski R, Toni F (1993) Abductive logic programming. J Logic Comput 718–770

  20. Kakas C, Riguzzi F (2000) Learning with abduction. New Gen Comput 18(3):243–284

    Google Scholar 

  21. Lamma E, Mello P, Milano M, Riguzzi F, Esposito F, Ferilli S, Semeraro G (2000) Cooperation of abduction and induction in logic programming. In: Kakas A, Flach P (eds) Abductive and inductive reasoning: essays on their relation and integration, Kluwer, Dordrecht

  22. LavračN, Džeroski S (1994) Inductive logic programming: techniques and applications. Ellis Horwood, New York

    Google Scholar 

  23. Michalski R (1994) Inferential theory of learning. developing foundations for multistrategy learning. In: Michalski R, Tecuci G (eds) Machine learning. A multistrategy approach, vol IV. Morgan Kaufmann, San Mateo, CA, pp 3–61

    Google Scholar 

  24. Poole D (1988) A logical framework for default reasoning. Artif Intell 36:27–47

    Article  MATH  MathSciNet  Google Scholar 

  25. Raedt LD, Dehaspe L (1997) Clausal discovery. Machine Learn 26(2):99–146

    Article  MATH  Google Scholar 

  26. Reiter R (1980) A logic for default reasoning. J Artif Intell 13:81–132

    Article  MATH  MathSciNet  Google Scholar 

  27. Riguzzi F (1998) Extensions of Logic Programming as Representation Languages for Machine Learning, PhD thesis, University of Bologna

  28. Skillicorn DB, Wang Y (2001) Parallel and sequential algorithms for data mining using inductive logic. Knowledge Inform Syst 3(4):405–421

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bari, Bari, Italy

    F. Esposito, S. Ferilli, T. M. A. Basile & N. Di Mauro

Authors
  1. F. Esposito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Ferilli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. M. A. Basile
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. N. Di Mauro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to F. Esposito.

Additional information

Floriana Esposito received the Laurea degree in electronic Physics from the University of Bari, Italy, in 1970. Since 1994 is Full Professor of Computer Science at the University of Bari and Dean of the Faculty of Computer Science from 1997 to 2002. She founded and chairs the Laboratory for Knowledge Acquisition and Machine Learning of the Department of Computer Science. Her research activity started in the field of numerical models and statistical pattern recognition. Then her interests moved to the field of Artificial Intelligence and Machine Learning. The current research concerns the logical and algebraic foundations of numerical and symbolic methods in machine learning with the aim of the integration, the computational models of incremental and multistrategy learning, the revision of logical theories, the knowledge discovery in data bases. Application include document classification and understanding, content based document retrieval, map interpretation and Semantic Web. She is author of more than 270 scientific papers and is in the scientific committees of many international scientific Conferences in the field of Artificial Intelligence and Machine Learning. She co-chaired ICML96, MSL98, ECML-PKDD 2003, IEA-AIE 2005, ISMIS 2006.

Stefano Ferilli was born in 1972. After receiving his Laurea degree in Information Science in 1996, he got a Ph.D. in Computer Science at the University of Bari in 2001. Since 2002 he is an Assistant Professor at the Department of Computer Science of the University of Bari. His research interests are centered on Logic and Algebraic Foundations of Machine Learning, Inductive Logic Programming, Theory Revision, Multi-Strategy Learning, Knowledge Representation, Electronic Document Processing and Digital Libraries. He participated in various National and European (ESPRIT and IST) projects concerning these topics, and is a (co-)author of more than 80 papers published on National and International journals, books and conferences/workshops proceedings.

Teresa M.A. Basile got the Laurea degree in Computer Science at the University of Bari, Italy (2001). In March 2005 she discussed a Ph.D. thesis in Computer Science at the University of Bari titled “A Multistrategy Framework for First-Order Rules Learning.” Since April 2005, she is a research at the Computer Science Department of the University of Bari working on methods and techniques of machine learning for the Semantic Web. Her research interests concern the investigation of symbolic machine learning techniques, in particular of the cooperation of different inferences strategies in an incremental learning framework, and their application to document classification and understanding based on their semantic. She is author of about 40 papers published on National and International journals and conferences/workshops proceedings and was/is involved in various National and European projects.

Nicola Di Mauro got the Laurea degree in Computer Science at the University of Bari, Italy. From 2001 he went on making research on machine learning in the Knowledge Acquisition and Machine Learning Laboratory (LACAM) at the Department of Computer Science, University of Bari. In March 2005 he discussed a Ph.D. thesis in Computer Science at the University of Bari titled “First Order Incremental Theory Refinement” which faces the problem of Incremental Learning in ILP. Since January 2005, he is an assistant professor at the Department of Computer Science, University of Bari. His research activities concern Inductive Logic Programming (ILP), Theory Revision and Incremental Learning, Multistrategy Learning, with application to Automatic Document Processing. On such topics HE is author of about 40 scientific papers accepted for presentation and publication on international and national journals and conference proceedings. He took part to the European projects 6th FP IP-507173 VIKEF (Virtual Information and Knowledge Environment Framework) and IST-1999-20882 COLLATE (Collaboratory for Annotation, Indexing and Retrieval of Digitized Historical Archive Materials), and to various national projects co-funded by the Italian Ministry for the University and Scientific Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Esposito, F., Ferilli, S., Basile, T.M.A. et al. Inference of abduction theories for handling incompleteness in first-order learning. Knowl Inf Syst 11, 217–242 (2007). https://doi.org/10.1007/s10115-006-0019-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-006-0019-5

Keywords

Search

Navigation