Skip to main content

Reasoning About Exceptions in Ontologies: An Approximation of the Multipreference Semantics

  • Conference paper
  • First Online:

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

Abstract

Starting from the observation that rational closure has the undesirable property of being an “all or nothing” mechanism, we here consider a multipreferential semantics, which enriches the preferential semantics underlying rational closure in order to separately deal with the inheritance of different properties in an ontology with exceptions. We show that the MP-closure of an \(\mathcal {ALC}\) knowledge base is a construction which is sound with respect to minimal entailment in the multipreference semantics for \(\mathcal {ALC}\).

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

Buying options

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

Learn about institutional subscriptions

Notes

  1. 1.

    Indeed, it is easy to see that, for a satisfiable \(K_i\), in the minimal ranked models \(\mathcal {M}_i\) of \(K_i\), which are the models of the rational closure of \(K_i\), two elements \(x,y \in \varDelta \) either have rank 0, and satisfy all the conditionals \(\mathbf{T}(C) \sqsubseteq A_i\) in \( K_i\), or have rank 1, and falsify at least some conditional \(\mathbf{T}(C) \sqsubseteq A_i\) in \( K_i\).

References

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

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Benferhat, S., Dubois, D., Prade, H.: Possibilistic logic: from nonmonotonicity to logic programming. In: Clarke, M., Kruse, R., Moral, S. (eds.) ECSQARU 1993. LNCS, vol. 747, pp. 17–24. Springer, Heidelberg (1993). https://doi.org/10.1007/BFb0028177

    Chapter  Google Scholar 

  4. Bonatti, P.A.: Rational closure for all description logics. Artif. Intell. 274, 197–223 (2019)

    Article  MathSciNet  Google Scholar 

  5. 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 

  6. Bonatti, P.A., Faella, M., Sauro, L.: Defeasible inclusions in low-complexity DLs. J. Artif. Intell. Res. (JAIR) 42, 719–764 (2011)

    MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Bonatti, P.A., Sauro, L.: On the logical properties of the nonmonotonic description logic DL\({}^{\text{ N }}\). Artif. Intell. 248, 85–111 (2017)

    MathSciNet  MATH  Google Scholar 

  9. Bozzato, L., Eiter, T., Serafini, L.: Enhancing context knowledge repositories with justifiable exceptions. Artif. Intell. 257, 72–126 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  10. Britz, K., Varzinczak, I.: Rationality and context in defeasible subsumption. In: Ferrarotti, F., Woltran, S. (eds.) FoIKS 2018. LNCS, vol. 10833, pp. 114–132. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-90050-6_7

    Chapter  MATH  Google Scholar 

  11. Britz, A., Varzinczak, I.: Contextual rational closure for defeasible ALC (extended abstract). In: Proceedings of the 32nd International Workshop on Description Logics, Oslo, Norway, 18–21 June 2019 (2019)

    Google Scholar 

  12. 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), Sidney, Australia, September 2008, pp. 476–484. AAAI Press (2008)

    Google Scholar 

  13. Casini, G., Meyer, T., Moodley, K., Nortjé, R.: Relevant closure: a new form of defeasible reasoning for description logics. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 92–106. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11558-0_7

    Chapter  MATH  Google Scholar 

  14. Casini, G., Meyer, T., Moodley, K., Sattler, U., Varzinczak, I.: Introducing defeasibility into OWL ontologies. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9367, pp. 409–426. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25010-6_27

    Chapter  Google Scholar 

  15. Casini, G., Meyer, T., Varzinczak, I.J., Moodley, K.: Nonmonotonic reasoning in description logics: rational closure for the ABox. In: DL 2013, 26th International Workshop on Description Logics, volume 1014 of CEUR Workshop Proceedings, pp. 600–615. CEUR-WS.org (2013)

    Google Scholar 

  16. Casini, G., Straccia, U.: Rational closure for defeasible description logics. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS (LNAI), vol. 6341, pp. 77–90. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15675-5_9

    Chapter  MATH  Google Scholar 

  17. Casini, G., Straccia, U.: Defeasible inheritance-based description logics. In: Walsh, T. (ed.) Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), Barcelona, Spain, July 2011, pp. 813–818. Morgan Kaufmann (2011)

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. 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  MATH  Google Scholar 

  21. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R.: Well-founded semantics for description logic programs in the semantic web. ACM Trans. Comput. Log. 12(2), 11 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  22. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artif. Intell. 172(12–13), 1495–1539 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  23. Fernandez Gil, O.: On the Non-Monotonic Description Logic ALC+T\({}_{\text{ min }}\). CoRR, abs/1404.6566 (2014)

    Google Scholar 

  24. Giordano, L., Gliozzi, V.: Encoding a preferential extension of the description logic \(\cal{SROIQ}\) into \(\cal{SROIQ}\). In: Esposito, F., Pivert, O., Hacid, M.-S., Raś, Z.W., Ferilli, S. (eds.) ISMIS 2015. LNCS (LNAI), vol. 9384, pp. 248–258. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25252-0_27

    Chapter  Google Scholar 

  25. Giordano, L., Gliozzi, V.: Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure. CoRR, abs/1807.02879 (2018)

    Google Scholar 

  26. Giordano, L., Gliozzi, V.: Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure. In: Proceedings of the Second Workshop on Logics for Reasoning about Preferences, Uncertainty, and Vagueness, PRUV@IJCAR 2018, Oxford, UK, 19 July 2018 (2008)

    Google Scholar 

  27. Giordano, L., Gliozzi, V.: Reasoning about multiple aspects in DLs: semantics and closure construction. CoRR, abs/1801.07161 (2018)

    Google Scholar 

  28. Giordano, L., Gliozzi, V.: A reconstruction of the multipreference closure. CoRR, abs/1905.03855 (2019)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  31. 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 

  32. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Minimal model semantics and rational closure in description logics. In: 26th International Workshop on Description Logics (DL 2013), August 2013, vol. 1014, pp. 168–180 (2013)

    Google Scholar 

  33. Gliozzi, V.: Reasoning about multiple aspects in rational closure for DLs. In: Proceedings of AI*IA 2016 - XVth International Conference of the Italian Association for Artificial Intelligence, Genova, Italy, 29 November–1 December 2016, pp. 392–405 (2016)

    Chapter  Google Scholar 

  34. Gottlob, G., Hernich, A., Kupke, C., Lukasiewicz, T.: Stable model semantics for guarded existential rules and description logics. In: Proceedings of KR 2014 (2014)

    Google Scholar 

  35. 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, volume 353 of CEUR Workshop Proceedings, Dresden, Germany, May 2008 CEUR-WS.org (2008)

    Google Scholar 

  36. 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 

  37. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  39. Lehmann, D.J.: Another perspective on default reasoning. Ann. Math. Artif. Intell. 15(1), 61–82 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  40. Moodley, K.: Practical reasoning for defeasible description logics. Ph.D. Thesis, University of Kwazulu-Natal (2016)

    Google Scholar 

  41. Motik, B., Rosati, R.: Reconciling description logics and rules. J. ACM 57(5), 1–62 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  42. Pearl, J.: System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning. In: Parikh, R. (ed.) TARK 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, pp. 121–135. Morgan Kaufmann, Pacific Grove, CA, USA (1990)

    Google Scholar 

  43. Straccia, U.: Default inheritance reasoning in hybrid KL-one-style logics. In: Bajcsy, R. (ed.) Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 1993), Chambéry, France, August 1993. pp. 676–681, Morgan Kaufmann (1993)

    Google Scholar 

Download references

Acknowledgement

This research is partially supported by INDAM-GNCS Project 2018 “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., Gliozzi, V. (2019). Reasoning About Exceptions in Ontologies: An Approximation of the Multipreference Semantics. In: Kern-Isberner, G., Ognjanović, Z. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2019. Lecture Notes in Computer Science(), vol 11726. Springer, Cham. https://doi.org/10.1007/978-3-030-29765-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-29765-7_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-29764-0

  • Online ISBN: 978-3-030-29765-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics