Skip to main content

Extending \(\mathcal {ALC}\) with the Power-Set Construct

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11468))

Included in the following conference series:

  • 683 Accesses

Abstract

We continue our exploration of the relationships between Description Logics and Set Theory, which started with the definition of the description logic \(\mathcal {ALC}^\varOmega \). We develop a set-theoretic translation of the description logic \(\mathcal {ALC}^\varOmega \) in the set theory \(\varOmega \), exploiting a technique originally proposed for translating normal modal and polymodal logics into \(\varOmega \).

We first define a set-theoretic translation of \(\mathcal {ALC}\) based on Schild’s correspondence with polymodal logics. Then we propose a translation of the fragment \( \mathcal {LC}^{\varOmega } \) of \(\mathcal {ALC}^\varOmega \) without roles and individual names. In this—simple—case the power-set concept is mapped, as expected, to the set-theoretic power-set, making clearer the real nature of the power-set concept in \(\mathcal {ALC}^\varOmega \). Finally, we encode the whole language of \(\mathcal {ALC}^\varOmega \) into its fragment without roles, showing that such a fragment is as expressive as \(\mathcal {ALC}^\varOmega \). The encoding provides, as a by-product, a set-theoretic translation of \(\mathcal {ALC}^\varOmega \) into the theory \(\varOmega \), which can be used as basis for extending other, more expressive, DLs with the power-set construct.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

    In the following, for readability, we will denote by \(\in \), \( Pow \), \(\cup \), \(\backslash \) (rather than \( Pow^\mathcal {M} \), \(\cup ^\mathcal {M}\), \(\backslash ^\mathcal {M}\)) the interpretation in a model \(\mathcal {M}\) of the predicate and function symbols \(\in \), \( Pow \), \(\cup \), \(\backslash \).

  2. 2.

    Further concept names would be needed to translate role assertions.

References

  1. Aczel, P.: Non-Well-Founded Sets, vol. 14. CSLI Lecture Notes, Stanford (1988)

    MATH  Google Scholar 

  2. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook - Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2007)

    Book  Google Scholar 

  3. D’Agostino, G., Montanari, A., Policriti, A.: A set-theoretic translation method for polymodal logics. J. Autom. Reasoning 15(3), 317–337 (1995)

    Article  MathSciNet  Google Scholar 

  4. De Giacomo, G., Lenzerini, M., Rosati, R.: Higher-order description logics for domain metamodeling. In: Proceedings of AAAI 2011, San Francisco, California, USA, 7–11 August 2011

    Google Scholar 

  5. Giordano, L., Policriti, A.: Power(Set) ALC. In ICTCS, 19th Italian Conference on Theoretical Computer Science, Urbino, Italy, 18–20 September 2018

    Google Scholar 

  6. Giordano, L., Policriti, A.: Adding the Power-Set to Description Logics. CoRR abs/1902.09844, February 2019

    Google Scholar 

  7. Glimm, B., Rudolph, S., Völker, J.: Integrated metamodeling and diagnosis in OWL 2. In: Patel-Schneider, P.F., Pan, Y., Hitzler, P., Mika, P., Zhang, L., Pan, J.Z., Horrocks, I., Glimm, B. (eds.) ISWC 2010. LNCS, vol. 6496, pp. 257–272. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17746-0_17

    Chapter  Google Scholar 

  8. Gu, Z.: Meta-modeling extension of Horn-SROIQ and query answering. In: Proceedings of the 29th International Workshop on Description Logics, Cape Town, South Africa, 22–25 April 2016

    Google Scholar 

  9. Homola, M., Kluka, J., Svátek, V., Vacura, M.: Typed higher-order variant of SROIQ - why not? In: Proceedings 27th International Workshop on Description Logics, Vienna, Austria, 17–20 July, pp. 567–578 (2014)

    Google Scholar 

  10. Kubincová, P., Kluka, J., Homola, M.: Towards expressive metamodelling with instantiation. In: Proceedings of the 28th International Workshop on Description Logics, Athens, 7–10 June 2015

    Google Scholar 

  11. Motik, B.: On the Properties of Metamodeling in OWL. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 548–562. Springer, Heidelberg (2005). https://doi.org/10.1007/11574620_40

    Chapter  Google Scholar 

  12. Motz, R., Rohrer, E., Severi, P.: The description logic SHIQ with a flexible meta-modelling hierarchy. J. Web Sem. 35, 214–234 (2015)

    Article  Google Scholar 

  13. Omodeo, E.G., Policriti, A., Tomescu, A.I.: Perspectives Logic Combinatorics. On Sets and Graphs. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-54981-1

    Book  MATH  Google Scholar 

  14. Pan, J.Z., Horrocks, I., Schreiber, G.: OWL FA: A metamodeling extension of OWL DL. In Proceedings of OWLED 2005 Workshop, Galway, Ireland, 11–12 November 2005

    Google Scholar 

  15. Patel-Schneider, P.F., Hayes, P.H., Horrocks. I.: OWL Web Ontology Language; Semantics and Abstract Syntax (2002). http://www.w3.org/TR/owl-semantics/

  16. Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Proceedings IJCAI 1991, Sydney, Australia, 24–30 August 1991, pp. 466–471 (1991)

    Google Scholar 

  17. Welty, C., Ferrucci, D.: What’s in an instance? Technical report, pp. 94–18, Max-Plank-Institut, RPI computer Science (1994)

    Google Scholar 

Download references

Acknowledgement

This research is partially supported by INDAM-GNCS Project 2019: Metodi di prova orientati al ragionamento automatico per logiche non-classiche.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Laura Giordano .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Giordano, L., Policriti, A. (2019). Extending \(\mathcal {ALC}\) with the Power-Set Construct. In: Calimeri, F., Leone, N., Manna, M. (eds) Logics in Artificial Intelligence. JELIA 2019. Lecture Notes in Computer Science(), vol 11468. Springer, Cham. https://doi.org/10.1007/978-3-030-19570-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-19570-0_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-19569-4

  • Online ISBN: 978-3-030-19570-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics