Skip to main content

Reasoning about Multiple Aspects in Rational Closure for DLs

  • Conference paper
  • First Online:

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

Abstract

We propose a logical analysis of the concept of typicality, central in human cognition (Rosch 1978). We start from a previously proposed extension of the basic Description Logic \(\mathcal {ALC}\) with a typicality operator \(\mathbf{T}\) that allows to consistently represent the attribution to classes of individuals of properties with exceptions (as in the classic example (i) typical birds fly, (ii) penguins are birds but (iii) typical penguins don’t fly). We then strengthen this extension in order to separately reason about the typicality with respect to different aspects (e.g., flying, having nice feather: in the previous example, penguins may not inherit the property of flying, for which they are exceptional, but can nonetheless inherit other properties, such as having nice feather).

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

References

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

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

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

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

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

    Article  MathSciNet  MATH  Google Scholar 

  6. 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), vol. 1014, pp. 168–180 (2013)

    Google Scholar 

  7. 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, pp. 676–681. Morgan Kaufmann, August 1993

    Google Scholar 

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

  9. Donini, F.M., Nardi, D., Rosati, R.: Description logics of minimal knowledge and negation as failure. ACM Trans. Comput. Log. (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: Dubois, D., Welty, C., Williams, M. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference (KR 2004), Whistler, pp. 141–151. AAAI Press, 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). doi:10.1007/978-3-540-75560-9_20

    Chapter  Google Scholar 

  12. 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, Dresden, vol. 353, May 2008. CEUR-WS.org

  13. 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, pp. 476–484. AAAI Press, September 2008

    Google Scholar 

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

  15. 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). doi:10.1007/978-3-642-15675-5_9

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Krisnadhi, A.A., Sengupta, K., Hitzler, P.: Local closed world semantics: keep it simple, stupid! In: Proceedings of Description Logics. CEUR Workshop Proceedings, Barcelona, vol. 745, July 2011

    Google Scholar 

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

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

  20. 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, pp. 813–818. Morgan Kaufmann, July 2011

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  23. 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, Heidelberg (2014). doi:10.1007/978-3-319-11558-0_7

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  25. Gil, O.F.: On the non-monotonic description logic ALC+T\({}_{\text{min}}\). In: 15th International Workshop on Non-Monotonic Reasoning (2014)

    Google Scholar 

Download references

Acknowledgement

This research is partially supported by INDAM-GNCS Project 2016 “Ragionamento Defeasible nelle Logiche Descrittive”.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Valentina Gliozzi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Gliozzi, V. (2016). Reasoning about Multiple Aspects in Rational Closure for DLs. In: Adorni, G., Cagnoni, S., Gori, M., Maratea, M. (eds) AI*IA 2016 Advances in Artificial Intelligence. AI*IA 2016. Lecture Notes in Computer Science(), vol 10037. Springer, Cham. https://doi.org/10.1007/978-3-319-49130-1_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49130-1_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49129-5

  • Online ISBN: 978-3-319-49130-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics