Learning Description Logic Axioms from Discrete Probability Distributions over Description Graphs

  • Francesco KriegelEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11468)


Description logics in their standard setting only allow for representing and reasoning with crisp knowledge without any degree of uncertainty. Of course, this is a serious shortcoming for use cases where it is impossible to perfectly determine the truth of a statement. For resolving this expressivity restriction, probabilistic variants of description logics have been introduced. Their model-theoretic semantics is built upon so-called probabilistic interpretations, that is, families of directed graphs the vertices and edges of which are labeled and for which there exists a probability measure on this graph family. Results of scientific experiments, e.g., in medicine, psychology, or biology, that are repeated several times can induce probabilistic interpretations in a natural way. In this document, we shall develop a suitable axiomatization technique for deducing terminological knowledge from the assertional data given in such probabilistic interpretations. More specifically, we consider a probabilistic variant of the description logic \(\mathcal {E\!L}^{\!\bot }\), and provide a method for constructing a set of rules, so-called concept inclusions, from probabilistic interpretations in a sound and complete manner.


Data mining Knowledge acquisition Probabilistic description logic Knowledge base Probabilistic interpretation Concept inclusion 



The author gratefully thanks Franz Baader for drawing attention to the issue in [15], and furthermore thanks the reviewers for their constructive remarks.


  1. 1.
    Baader, F., Distel, F.: A finite basis for the set of \(\cal{EL}\)-implications holding in a finite model. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol. 4933, pp. 46–61. Springer, Heidelberg (2008). Scholar
  2. 2.
    Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017)CrossRefGoogle Scholar
  3. 3.
    Bacchus, F.: Representing and reasoning with probabilistic knowledge. Ph.D. thesis, The University of Alberta, Edmonton, Alberta (1988)Google Scholar
  4. 4.
    Borchmann, D.: Learning terminological knowledge with high confidence from erroneous data. Doctoral thesis, Technische Universität Dresden, Dresden, Germany (2014)Google Scholar
  5. 5.
    Borchmann, D., Distel, F., Kriegel, F.: Axiomatisation of general concept inclusions from finite interpretations. J. Appl. Non-Class. Log. 26(1), 1–46 (2016)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Distel, F.: Learning description logic knowledge bases from data using methods from formal concept analysis. Doctoral thesis, Technische Universität Dresden, Dresden, Germany (2011)Google Scholar
  7. 7.
    Ganter, B.: Two Basic Algorithms in Concept Analysis. FB4-Preprint 831, Technische Hochschule Darmstadt, Darmstadt, Germany (1984)Google Scholar
  8. 8.
    Ganter, B., Obiedkov, S.A.: Conceptual Exploration. Springer, Heidelberg (2016). Scholar
  9. 9.
    Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999). Scholar
  10. 10.
    Guigues, J.L., Duquenne, V.: Famille minimale d’implications informatives résultant d’un tableau de données binaires. Mathématiques et Sciences Humaines 95, 5–18 (1986)Google Scholar
  11. 11.
    Gutiérrez-Basulto, V., Jung, J.C., Lutz, C., Schröder, L.: Probabilistic description logics for subjective uncertainty. J. Artif. Intell. Res. 58, 1–66 (2017)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Halpern, J.Y.: An analysis of first-order logics of probability. Artif. Intell. 46(3), 311–350 (1990)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Heinsohn, J.: Probabilistic description logics. In: López de Mántaras, R., Poole, D. (eds.) UAI 1994: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence, Seattle, Washington, USA, 29–31 July 1994, pp. 311–318. Morgan Kaufmann (1994)Google Scholar
  14. 14.
    Jaeger, M.: Probabilistic reasoning in terminological logics. In: Doyle, J., Sandewall, E., Torasso, P. (eds.) Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR 1994), Bonn, Germany, 24–27 May 1994, pp. 305–316. Morgan Kaufmann (1994)CrossRefGoogle Scholar
  15. 15.
    Kriegel, F.: Axiomatization of general concept inclusions in probabilistic description logics. In: Hölldobler, S., Krötzsch, M., Peñaloza, R., Rudolph, S. (eds.) KI 2015. LNCS (LNAI), vol. 9324, pp. 124–136. Springer, Cham (2015). Scholar
  16. 16.
    Kriegel, F.: Incremental learning of TBoxes from interpretation sequences with methods of formal concept analysis. In: Calvanese, D., Konev, B. (eds.) Proceedings of the 28th International Workshop on Description Logics, Athens, Greece, 7–10 June 2015. CEUR Workshop Proceedings, vol. 1350. (2015)Google Scholar
  17. 17.
    Kriegel, F.: Acquisition of terminological knowledge from social networks in description logic. In: Missaoui, R., Kuznetsov, S.O., Obiedkov, S. (eds.) Formal Concept Analysis of Social Networks. LNSN, pp. 97–142. Springer, Cham (2017). Scholar
  18. 18.
    Kriegel, F.: Implications over probabilistic attributes. In: Bertet, K., Borchmann, D., Cellier, P., Ferré, S. (eds.) ICFCA 2017. LNCS (LNAI), vol. 10308, pp. 168–183. Springer, Cham (2017). Scholar
  19. 19.
    Kriegel, F.: Probabilistic implication bases in FCA and probabilistic bases of GCIs in \(\cal{EL}^{\bot }\). Int. J. Gen. Syst. 46(5), 511–546 (2017)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Kriegel, F.: Acquisition of terminological knowledge in probabilistic description logic. In: Trollmann, F., Turhan, A.-Y. (eds.) KI 2018. LNCS (LNAI), vol. 11117, pp. 46–53. Springer, Cham (2018). Scholar
  21. 21.
    Kriegel, F.: Learning description logic axioms from discrete probability distributions over description graphs (extended version). LTCS-Report 18–12, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany (2018).
  22. 22.
    Kriegel, F.: Most specific consequences in the description logic \(\cal{EL}\). LTCS-Report 18–11, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany (2018)., accepted for publication in Discrete Applied Mathematics
  23. 23.
    Lukasiewicz, T.: Expressive probabilistic description logics. Artif. Intell. 172(6–7), 852–883 (2008)MathSciNetCrossRefGoogle Scholar
  24. 24.
    Rudolph, S.: Relational exploration: combining description logics and formal concept analysis for knowledge specification. Doctoral thesis, Technische Universität Dresden, Dresden, Germany (2006)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Institute of Theoretical Computer ScienceTechnische Universität DresdenDresdenGermany

Personalised recommendations