Skip to main content
SpringerLink
Log in

Reasoning with Justifiable Exceptions in \(\mathcal{E}\mathcal{L}_\bot \) Contextualized Knowledge Repositories

  • Chapter
  • First Online:
Description Logic, Theory Combination, and All That

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11560))

Abstract

The Contextualized Knowledge Repository (CKR) framework has been proposed as a description logics-based approach for contextualization of knowledge, a well-known area of study in AI. The CKR knowledge bases are structured in two layers: a global context contains context-independent knowledge and contextual structure, while a set of local contexts hold specific knowledge bases. In practical uses of CKR, it is often desirable that global knowledge can be “overridden” at the local level, that is to recognize local pieces of knowledge that do not need to satisfy the general axiom. By targeting this need, in our recent works we presented an extension of CKR with global defeasible axioms, which apply local instances unless an exception for overriding exists; such an exception, however, requires that justification is provable from the knowledge base. In this paper we apply this framework to the basic description logic \(\mathcal{E}\mathcal{L}_\bot \). We provide a formalization of \(\mathcal{E}\mathcal{L}_\bot \) CKRs with global defeasible axioms and study their semantic and computational properties. Moreover, we present a translation of CKRs to datalog programs under the answer set semantics for instance checking.

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

Access this chapter

Log in via an institution
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.

    Intuitively, \({{\small \mathsf {Ctx}}}\) will be used to denote the class of all contexts.

  2. 2.

    This restriction allows us to simplify the characterization of the datalog encoding: this is demonstrated as an example in [10].

References

  1. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  2. Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03, Acapulco, Mexico, 9–15 August 2003, pp. 325–330. Morgan Kaufmann (2003). http://ijcai.org/Proceedings/03/Papers/048.pdf

  3. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, 30 July–August 5 2005, pp. 364–369. Professional Book Center (2005). http://ijcai.org/Proceedings/05/Papers/0372.pdf

  4. Baader, F., Hollunder, B.: Embedding defaults into terminological knowledge representation formalisms. J. Autom. Reasoning 14(1), 149–180 (1995). https://doi.org/10.1007/BF00883932

    Article  MathSciNet  Google Scholar 

  5. Baader, F., Lutz, C., Brandt, S.: Pushing the EL envelope further. In: Clark, K., Patel-Schneider, P.F. (eds.) Proceedings of the Fourth OWLED Workshop on OWL: Experiences and Directions, CEUR Workshop Proceedings, Washington, DC, USA, 1–2 April 2008, vol. 496. CEUR-WS.org (2008). http://ceur-ws.org/Vol-496/owled2008dc_paper_3.pdf

  6. Bonatti, P.A., Faella, M., Petrova, I., Sauro, L.: A new semantics for overriding in description logics. Artif. Intell. 222, 1–48 (2015). https://doi.org/10.1016/j.artint.2014.12.010

    Article  MathSciNet  Google Scholar 

  7. Bonatti, P.A., Faella, M., Sauro, L.: Defeasible inclusions in low-complexity DLs. J. Artif. Intell. Res. 42, 719–764 (2011). https://doi.org/10.1613/jair.3360

    Article  MathSciNet  MATH  Google Scholar 

  8. Bonatti, P.A., Lutz, C., Wolter, F.: Description logics with circumscription. In: 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 400–410. AAAI Press (2006)

    Google Scholar 

  9. Bozzato, L., Eiter, T., Serafini, L.: Contextualized knowledge repositories with justifiable exceptions. In: DL2014. CEUR-WP, vol. 1193, pp. 112–123. CEUR-WS.org (2014)

    Google Scholar 

  10. Bozzato, L., Eiter, T., Serafini, L.: Enhancing context knowledge repositories with justifiable exceptions. Artif. Intell. 257, 72–126 (2018). https://doi.org/10.1016/j.artint.2017.12.005

    Article  MathSciNet  MATH  Google Scholar 

  11. Bozzato, L., Ghidini, C., Serafini, L.: Comparing contextual and flat representations of knowledge: a concrete case about football data. In: Benjamins, V.R., d’Aquin, M., Gordon, A. (eds.) 2013 Proceedings of the 7th International Conference on Knowledge Capture (K-CAP 2013), pp. 9–16. ACM (2013)

    Google Scholar 

  12. Bozzato, L., Homola, M., Serafini, L.: Towards more effective tableaux reasoning for CKR. In: Kazakov, Y., Lembo, D., Wolter, F. (eds.) Proceedings of the 2012 International Workshop on Description Logics, DL-2012, CEUR Workshop Proceedings, Rome, Italy, 7–10 June 2012, vol. 846, pp. 114–124. CEUR-WS.org (2012)

    Google Scholar 

  13. Bozzato, L., Serafini, L.: Materialization calculus for contexts in the semantic web. In: DL 2013. CEUR-WP, vol. 1014, pp. 552–572. CEUR-WS.org (2013)

    Google Scholar 

  14. 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. [23]

    Chapter  MATH  Google Scholar 

  15. Casini, G., Straccia, U., Meyer, T.: A polynomial time subsumption algorithm for nominal safe \(\cal{ELO}_\bot \) under rational closure. Inf. Sci. (2018, in press). https://doi.org/10.1016/j.ins.2018.09.037

  16. Dao-Tran, M., Eiter, T., Krennwallner, T.: Realizing default logic over description logic knowledge bases. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS (LNAI), vol. 5590, pp. 602–613. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02906-6_52

    Chapter  Google Scholar 

  17. 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). https://doi.org/10.1016/j.artint.2008.04.002

    Article  MathSciNet  MATH  Google Scholar 

  18. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, 365–385 (1991)

    Article  Google Scholar 

  19. Giordano, L., Dupré, D.T.: Defeasible reasoning in \(\cal{SROEL}\): from rational entailment to rational closure. Fundam. Inform. 161(1–2), 135–161 (2018). https://doi.org/10.3233/FI-2018-1698

    Article  MathSciNet  MATH  Google Scholar 

  20. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Reasoning about typicality in low complexity DLs: the logics \(\cal{E}\cal{L}^\bot T_{min}\) and \(\text{DL-Lite}_{c} T_{min}\). In: Walsh, T. (ed.) Proceedingsof the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Catalonia, Spain, 16–22 July 2011, pp. 894–899. IJCAI/AAAI (2011). https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-155

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

    Article  MathSciNet  Google Scholar 

  22. Giunchiglia, F., Serafini, L.: Multilanguage hierarchical logics, or: how we can do without modal logics. Artif. Intell. 65(1), 29–70 (1994)

    Article  MathSciNet  Google Scholar 

  23. Janhunen, T., Niemelä, I. (eds.): JELIA 2010. LNCS (LNAI), vol. 6341. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15675-5

    Book  MATH  Google Scholar 

  24. Klarman, S.: Reasoning with contexts in description logics. Ph.D. thesis, Free University of Amsterdam (2013)

    Google Scholar 

  25. Klarman, S., Gutiérrez-Basulto, V.: Two-dimensional description logics of context. In: DL 2011. CEUR-WP, vol. 745. CEUR-WS.org (2011)

    Google Scholar 

  26. Krötzsch, M.: Efficient inferencing for OWL EL. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS (LNAI), vol. 6341, pp. 234–246. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15675-5_21

    Chapter  Google Scholar 

  27. Lenat, D.: The dimensions of context space. Technical report, CYCorp (1998). http://www.cyc.com/doc/context-space.pdf

  28. McCarthy, J.: Notes on formalizing context. In: Bajcsy, R. (ed.) IJCAI 1993, pp. 555–562. Morgan Kaufmann (1993)

    Google Scholar 

  29. Motik, B., Fokoue, A., Horrocks, I., Wu, Z., Lutz, C., Grau, B.C.: OWL 2 web ontology language profiles. W3C recommendation, W3C, October 2009. http://www.w3.org/TR/2009/REC-owl2-profiles-20091027/

  30. Pensel, M., Turhan, A.-Y.: Including quantification in defeasible reasoning for the description logic \(\cal{EL} _{\bot } \). In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 78–84. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61660-5_9

    Chapter  MATH  Google Scholar 

  31. Pensel, M., Turhan, A.: Reasoning in the defeasible description logic \(\cal{EL}_{\bot }\) - computing standard inferences under rational and relevant semantics. Int. J. Approx. Reasoning 103, 28–70 (2018). https://doi.org/10.1016/j.ijar.2018.08.005

    Article  MathSciNet  MATH  Google Scholar 

  32. Reiter, R.: A logic for default reasoning. Artif. Intell. 13(12), 81–132 (1980). https://doi.org/10.1016/0004-3702(80)90014-4

    Article  MathSciNet  MATH  Google Scholar 

  33. Serafini, L., Homola, M.: Contextualized knowledge repositories for the semantic web. J. Web Semant. 12, 64–87 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fondazione Bruno Kessler, Via Sommarive 18, 38123, Trento, Italy

    Loris Bozzato & Luciano Serafini

  2. Institute of Logic and Computation, Technische Universität Wien, Favoritenstraße 9-11, 1040, Vienna, Austria

    Thomas Eiter

Authors
  1. Loris Bozzato
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Eiter
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luciano Serafini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Loris Bozzato .

Editor information

Editors and Affiliations

  1. University of Bremen, Bremen, Germany

    Carsten Lutz

  2. University of Manchester, Manchester, UK

    Uli Sattler

  3. University of Iowa, Iowa City, IA, USA

    Cesare Tinelli

  4. TU Dresden, Dresden, Germany

    Anni-Yasmin Turhan

  5. University of Liverpool, Liverpool, UK

    Frank Wolter

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bozzato, L., Eiter, T., Serafini, L. (2019). Reasoning with Justifiable Exceptions in \(\mathcal{E}\mathcal{L}_\bot \) Contextualized Knowledge Repositories. In: Lutz, C., Sattler, U., Tinelli, C., Turhan, AY., Wolter, F. (eds) Description Logic, Theory Combination, and All That. Lecture Notes in Computer Science(), vol 11560. Springer, Cham. https://doi.org/10.1007/978-3-030-22102-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22102-7_5

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation