Skip to main content

Encoding a Preferential Extension of the Description Logic \(\mathcal {SROIQ}\) into \(\mathcal {SROIQ}\)

  • Conference paper
  • First Online:
Foundations of Intelligent Systems (ISMIS 2015)

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

Included in the following conference series:

Abstract

In this paper we define an extension of the description logic \(\mathcal {SROIQ}\) based on a preferential semantics to introduce a notion of typicality in the language which allows defeasible inclusions to be represented in a knowledge base. We define a polynomial encoding of the resulting language into \(\mathcal {SROIQ}\), thus showing that reasoning in the preferential extension of \(\mathcal {SROIQ}\) has the same complexity as reasoning in \(\mathcal {SROIQ}\).

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

    The symmetric and transitive role assertions Sym(R) and Tra(R) can be replaced by suitable role inclusion axioms, respectively, \(R^- \sqsubseteq R\) and \(R \circ R \sqsubseteq R\) [16].

References

  1. Baader, F., Hollunder, B.: Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic. J. Autom. Reasoning (JAR) 15(1), 41–68 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bonatti, P.A., Faella, M., Petrova, I., Sauro, L.: A new semantics for overriding in description logics. Artif. Intell. 222, 1–48 (2015)

    Article  MathSciNet  Google Scholar 

  3. Bonatti, P.A., Lutz, C., Wolter, F.: The complexity of circumscription in DLs. J. Artif. Intell. Res. (JAIR) 35, 717–773 (2009)

    MathSciNet  MATH  Google Scholar 

  4. Britz, K., Heidema, J., Meyer, T.: Semantic preferential subsumption. In: Brewka, G., Lang, J. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the 11th International Conference (KR 2008), pp. 476–484. AAAI Press, Sidney, September 2008

    Google Scholar 

  5. Casini, G., Meyer, T., Varzinczak, I.J., Moodley, K.: Nonmonotonic Reasoning in Description Logics: Rational Closure for the ABox. In: DL 2013 CEUR Workshop Proceedings, vol. 1014, pp. 600–615 (2013)

    Google Scholar 

  6. Casini, G., Straccia, U.: Rational closure for defeasible description logics. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 77–90. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Casini, G., Straccia, U.: Lexicographic Closure for defeasible description logics. In: Proceedings of the Australasian Ontology Workshop vol. 969, pp. 28–39 (2012)

    Google Scholar 

  8. Casini, G., Straccia, U.: Defeasible inheritance-based description logics. J. Artif. Intell. Res. (JAIR) 48, 415–473 (2013)

    MathSciNet  MATH  Google Scholar 

  9. Donini, F.M., Nardi, D., Rosati, R.: Description logics of minimal knowledge and negation as failure. ACM Trans. Comput. Logic (ToCL) 3(2), 177–225 (2002)

    Article  MathSciNet  Google Scholar 

  10. Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. In: Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004). AAAI Press, Whistler, Canada, June 2004

    Google Scholar 

  11. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Preferential description logics. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 257–272. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: ALC+T: a preferential extension of description logics. Fundam. informaticae 96, 1–32 (2009)

    MathSciNet  MATH  Google Scholar 

  13. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: A nonmonotonic description logic for reasoning about typicality. Artif. Intell. 195, 165–202 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  14. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Rational closure in SHIQ. In: DL2014 CEUR Workshop Proceedings, vol. 1193, pp. 1–13 (2014)

    Google Scholar 

  15. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Semantic characterization of rational closure: From propositional logic to description logics. Artif. Intell. 226, 1–33 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  16. Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible SROIQ. In: Proceedings, Tenth International Conference on Principles of Knowledge Representation and Reasoning, Lake District of the United Kingdom, pp. 57–67, 2–5 June 2006

    Google Scholar 

  17. Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. Logic J. IGPL 8(3), 239–263 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Ke, P., Sattler, U.: Next steps for description logics of minimal knowledge and negation as failure. In: Baader, F., Lutz, C., Motik, B. (eds.) Proceedings of Description Logics. CEUR Workshop Proceedings, vol. 353, CEUR-WS.org, Dresden, May 2008

    Google Scholar 

  19. Knorr, M., Hitzler, P., Maier, F.: Reconciling owl and non-monotonic rules for the semantic web. In: ECAI 2012, pp. 474–479 (2012)

    Google Scholar 

  20. Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(1–2), 167–207 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  21. Krötzsch, M., Simančík, F., Horrocks, I.: A description logic primer. CoRR abs/1201.4089 (2012). http://arxiv.org/abs/1201.4089

  22. Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artif. Intell. 55(1), 1–60 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  23. Motik, B., Rosati, R.: Reconciling description logics and rules. J. ACM 57(5), 93–154 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  24. Schlobach, S., Klein, M.C.A., Peelen, L.: Description logics with approximate definitions - precise modeling of vague concepts. In: IJCAI 2007, Hyderabad, pp. 557–562 (2007)

    Google Scholar 

  25. Straccia, U.: Default inheritance reasoning in hybrid kl-one-style logics. In: Bajcsy, R. (ed.) Proceedings of IJCAI 1993, pp. 676–681. Morgan Kaufmann, Chambéry, August 1993

    Google Scholar 

Download references

Acknowledgement

We thank the anonymous referees for their helpful comments. This research is partially supported by INDAM - GNCS Project 2015 Description Logics and Nonmonotonic reasoning and by Compagnia di San Paolo Project GINSENG.

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

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Giordano, L., Gliozzi, V. (2015). Encoding a Preferential Extension of the Description Logic \(\mathcal {SROIQ}\) into \(\mathcal {SROIQ}\) . In: Esposito, F., Pivert, O., Hacid, MS., Rás, Z., Ferilli, S. (eds) Foundations of Intelligent Systems. ISMIS 2015. Lecture Notes in Computer Science(), vol 9384. Springer, Cham. https://doi.org/10.1007/978-3-319-25252-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25252-0_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25251-3

  • Online ISBN: 978-3-319-25252-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics