Skip to main content

Semantic Forgetting in Expressive Description Logics

  • Conference paper
  • First Online:
Frontiers of Combining Systems (FroCoS 2021)

Abstract

Forgetting is an important ontology extraction technology. We present a semantic forgetting method for \(\mathcal {ALC}\) ontologies. The method forgets concept names, and captures the semantic content over the remaining vocabulary of an ontology, possibly, by introducing helper concept symbols. In an evaluation, the method performed well on large-scale ontologies when forgetting 10–50% of the vocabulary and the number of helper symbols occurring in the extracts decreased as the number of forgetting symbols increased. Against the forgetting tool Fame(Q), good performance was achieved while more semantic content was preserved.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Proofs omitted from this paper are available in the long version at https://github.com/e73898ms/SemanticForgettinginExpressiveDescriptionLogics.

References

  1. Ackermann, W.: Untersuchungen über das Eliminationsproblem der mathematischen Logik. Math. Ann. 110, 390–413 (1935)

    Article  MathSciNet  Google Scholar 

  2. Baader, F., Horrocks, I., Sattler, U.: Description logics. In: Handbook of Knowledge Representation, pp. 135–179. Elsevier, San Diego (2007)

    Google Scholar 

  3. Baaz, M., Egly, U., Leitsch, A.: Normal form transformations. In: Handbook of Automated Reasoning, pp. 275–332. North-Holland (12 2001)

    Google Scholar 

  4. Boole, G.: An Investigation of the Laws of Thought: On Which Are Founded the Mathematical Theories of Logic and Probabilities. Cambridge University Press, Cambridge (1854)

    MATH  Google Scholar 

  5. Borgida, A.: On the relative expressiveness of description logics and predicate logics. Artif. Intell. 82(1–2), 353–367 (1996)

    Article  MathSciNet  Google Scholar 

  6. Botoeva, E., Konev, B., Lutz, C., Ryzhikov, V., Wolter, F., Zakharyaschev, M.: Inseparability and conservative extensions of description logic ontologies: A survey. In: Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering: 12th International Summer School. pp. 27–89. Springer (2017)

    Google Scholar 

  7. Chen, J., Alghamdi, G., Schmidt, R.A., Walther, D., Gao, Y.: Ontology extraction for large ontologies via modularity and forgetting. In: Proceedings of the 10th International Conference on Knowledge Capture (K-CAP 2019), pp. 45–52. ACM (2019)

    Google Scholar 

  8. Delgrande, J.: A knowledge level account of forgetting. J. Artif. Intell. Res. 60, 1165–1213 (2017)

    Article  MathSciNet  Google Scholar 

  9. Delgrande, J.P.: Towards a knowledge level analysis of forgetting. In: Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning, pp. 606–609. AAAI Press, Palo Alto (2014)

    Google Scholar 

  10. Ditmarsch, H., Herzig, A., Lang, J., Marquis, P.: Introspective forgetting. In: Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence. pp. 18–29. Springer (2008). https://doi.org/10.1007/s11229-009-9554-4

  11. Eiter, T., Kern-Isberner, G.: A brief survey on forgetting from a knowledge representation and reasoning perspective. KI - Künstliche Intelligenz 33(1), 9–33 (2019)

    Article  Google Scholar 

  12. Gabbay, D.M., Ohlbach, H.J.: Quantifier elimination in second-order predicate logic. In: Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, pp. 425–435. Morgan Kaufmann, San Mateo (1992)

    Google Scholar 

  13. Gabbay, D.M., Schmidt, R.A., Szałas, A.: Second-Order Quantifier Elimination: Foundations. College Publications, Computational Aspects and Applications (2008)

    Google Scholar 

  14. Herzig, A., Mengin, J.: Uniform interpolation by resolution in modal logic. In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 219–231. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87803-2_19

    Chapter  MATH  Google Scholar 

  15. Hustadt, U., Schmidt, R.A., Georgieva, L.: A survey of decidable first-order fragments and description logics. J. Relat. Methods Comput. Sci. 1, 251–276 (2004)

    Google Scholar 

  16. Jung, J., Lutz, C., Pulcini, H., Wolter, F.: Logical separability of incomplete data under ontologies. In: 17th International Conference on Principles of Knowledge Representation and Reasoning, pp. 517–528 (2020)

    Google Scholar 

  17. Konev, B., Lutz, C., Walther, D., Wolter, F.: Formal properties of modularisation. In: Stuckenschmidt, H., Parent, C., Spaccapietra, S. (eds.) Modular Ontologies. LNCS, vol. 5445, pp. 25–66. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01907-4_3

    Chapter  Google Scholar 

  18. Konev, B., Lutz, C., Walther, D., Wolter, F.: Model-theoretic inseparability and modularity of description logic ontologies. Artif. Intell. 203, 66–103 (2013)

    Article  MathSciNet  Google Scholar 

  19. Konev, B., Walther, D., Wolter, F.: Forgetting and uniform interpolation in large-scale description logic terminologies. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp. 830–835. Morgan Kaufmann (2009)

    Google Scholar 

  20. Koopmann, P., Schmidt, R.A.: Uniform interpolation of \(\cal{ALC}\)-ontologies using fixpoints. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS (LNAI), vol. 8152, pp. 87–102. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40885-4_7

    Chapter  MATH  Google Scholar 

  21. Koopmann, P., Schmidt, R.A.: Count and forget: uniform interpolation of \(\cal{SHQ}\)-ontologies. In: Automated Reasoning. Lecture Notes in Artificial Intelligence, vol. 8562, pp. 434–448. Springer, Berlin (2014). https://doi.org/10.1007/3-540-45470-5

  22. Koopmann, P., Schmidt, R.A.: Saturation-based forgetting in the description logic \(\cal{SIF}\). In: Proceedings of the 28th International Workshop on Description Logics, vol. 1350. CEUR-WS.org (2015)

    Google Scholar 

  23. Kushida, T., Kozaki, K., Kawamura, T., Tateisi, Y., Yamamoto, Y., Takagi, T.: Interconnection of biological knowledge using NikkajiRDF and interlinking ontology for biological concepts. New Gen. Compu. 37, 1–25 (2019)

    Google Scholar 

  24. Lang, J., Liberatore, P., Marquis, P.: Propositional independence: formula-variable independence and forgetting. J. Artif. Intell. Res. 18, 391–443 (2003)

    Article  MathSciNet  Google Scholar 

  25. Lin, F., Reiter, R.: Forget it!. Proc. AAAI 1994, 154–159 (1994)

    Google Scholar 

  26. Lin, F., Reiter, R.: How to progress a database (and why) I. logical foundations. In: Principles of Knowledge Representation and Reasoning, pp. 425–436. Morgan Kaufmann, Cambridge (1994)

    Google Scholar 

  27. Ludwig, M., Konev, B.: Towards practical uniform interpolation and forgetting for \(\cal{ALC}\) tboxes. In: Proceedings of the 26th International Workshop on Description Logics. CEUR-WS (2013)

    Google Scholar 

  28. Lutz, C., Wolter, F.: Foundations for uniform interpolation and forgetting in expressive description logics. In: IJCAI International Joint Conference on Artificial Intelligence. AAAI Press (2011)

    Google Scholar 

  29. Lutz, C., Wolter, F.: Deciding inseparability and conservative extensions in the description logic \(\cal{EL}\). J. Symbol. Comput. 45, 194–228 (2010)

    Google Scholar 

  30. Matentzoglu, N., Bail, S., Parsia, B.: A snapshot of the OWL web. In: The Semantic Web - ISWC 2013, pp. 331–346. Springer (2013)

    Google Scholar 

  31. Nonnengart, A., Szalas, A.: A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In: Orlowska, E. (ed.) Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa (1999) vol. 24, January 1998

    Google Scholar 

  32. Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Handbook of Automated Reasoning, pp. 335–367. North-Holland, Amsterdam (2001)

    Google Scholar 

  33. Sakr, M., Schmidt, R.A.: Fine-grained forgetting for the description logic \(\cal{ALC}\) (2021). http://www.cs.man.ac.uk/~schmidt/publications/SakrSchmidt21a.pdf.

  34. Schmidt, R.A.: The Ackermann approach for modal logic, correspondence theory and second-order reduction. J. Appl. Logic 10(1), 52–74 (2012)

    Article  MathSciNet  Google Scholar 

  35. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacif. J. Math. 5(2), 285–309 (1955)

    Article  MathSciNet  Google Scholar 

  36. Wernhard, C.: Projection and scope-determined circumscription. J. Symbol. Comput. 47, 1089–1108 (2012)

    Article  MathSciNet  Google Scholar 

  37. Wernhard, C.: Application patterns of projection/forgetting. In: Workshop on Interpolation: From Proofs to Applications (iPRA 2014) (2014)

    Google Scholar 

  38. Zhang, Y., Zhou, Y.: Forgetting revisited. In: Twelfth International Conference on the Principles of Knowledge Representation and Reasoning (2010)

    Google Scholar 

  39. Zhao, Y., Schmidt, R.A.: Concept forgetting in \(\cal{ALCOI}\)-ontologies using an Ackermann approach. In: The Semantic Web, 14th International Semantic Web Conference. Lecture Notes in Computer Science, vol. 9366, pp. 587–602. Springer (2015). https://doi.org/10.1007/b102467

  40. Zhao, Y., Schmidt, R.A.: Forgetting concept and role symbols in \(\cal{ALCOIH}\mu ^+(\nabla ,\sqcap )\)-ontologies. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, pp. 1345–1352. AAAI Press/IJCAI (2016)

    Google Scholar 

  41. Zhao, Y., Schmidt, R.A.: Role forgetting for \(\cal{ALCOQH}(\nabla )\)-ontologies using an Ackermann approach. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, pp. 1354–1361. AAAI Press/IJCAI (2017)

    Google Scholar 

  42. Zhao, Y., Schmidt, R.A.: On concept forgetting in description logics with qualified number restrictions. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, pp. 1984–1990. AAAI Press/IJCAI (2018)

    Google Scholar 

  43. Zhao, Y., Schmidt, R.A.: FAME(Q): an automated tool for forgetting in description logics with qualified number restrictions. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 568–579. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-29436-6_34

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mostafa Sakr .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sakr, M., Schmidt, R.A. (2021). Semantic Forgetting in Expressive Description Logics. In: Konev, B., Reger, G. (eds) Frontiers of Combining Systems. FroCoS 2021. Lecture Notes in Computer Science(), vol 12941. Springer, Cham. https://doi.org/10.1007/978-3-030-86205-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-86205-3_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-86204-6

  • Online ISBN: 978-3-030-86205-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics