Learning Probabilistic Description Logics

  • Fabrizio Riguzzi
  • Elena Bellodi
  • Evelina Lamma
  • Riccardo Zese
  • Giuseppe Cota
Conference paper

DOI: 10.1007/978-3-319-13413-0_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8816)
Cite this paper as:
Riguzzi F., Bellodi E., Lamma E., Zese R., Cota G. (2014) Learning Probabilistic Description Logics. In: Bobillo F. et al. (eds) Uncertainty Reasoning for the Semantic Web III. Lecture Notes in Computer Science, vol 8816. Springer, Cham

Abstract

We consider the problem of learning both the structure and the parameters of Probabilistic Description Logics under the DISPONTE semantics. DISPONTE is based on the distribution semantics for Probabilistic Logic Programming and assigns a probability to assertional and terminological axioms. The system EDGE, given a DISPONTE knowledge base (KB) and sets of positive and negative examples in the form of concept assertions, returns the value of the probabilities associated with axioms. We present the system LEAP that learns both the structure and the parameters of DISPONTE KBs explotiting EDGE. LEAP is based on the system CELOE for ontology engineering and exploits its search strategy in the space of possible axioms. LEAP uses the axioms returned by CELOE to build a KB so that the likelihood of the examples is maximized. We present experiments showing the potential of EDGE and LEAP.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Fabrizio Riguzzi
    • 1
  • Elena Bellodi
    • 2
  • Evelina Lamma
    • 2
  • Riccardo Zese
    • 2
  • Giuseppe Cota
    • 2
  1. 1.Dipartimento di Matematica e InformaticaUniversity of FerraraFerraraItaly
  2. 2.Dipartimento di IngegneriaUniversity of FerraraFerraraItaly

Personalised recommendations