Skip to main content

A Defeasible Description Logic for Abduction

  • Conference paper
  • First Online:
AIxIA 2023 – Advances in Artificial Intelligence (AIxIA 2023)

Abstract

In this work we introduce a defeasible Description Logic for abductive reasoning. Our proposal exploits a fragment of a probabilistic extension of a Description Logic of typicality, whose semantics corresponds to a natural extension of the well established mechanism of rational closure extended to Description Logics. The presence of typicality assertions that can be non-monotonically inferred from a knowledge base, corresponding to those belonging to its rational closure, avoids the need of an explicit selection of abducibles.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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 Theorem 10 in [15] the authors have shown that for any consistent KB there exists a finite minimal canonical model of KB.

  2. 2.

    The meaning of probability/degree here is significantly different from those of the DISPONTE semantics in [26] and of the one used to define typicality in probabilistic DLs in [22].

References

  1. Azzolini, D., Bellodi, E., Ferilli, S., Riguzzi, F., Zese, R.: Abduction with probabilistic logic programming under the distribution semantics. Int. J. Approx. Reason. 142, 41–63 (2022). https://doi.org/10.1016/j.ijar.2021.11.003

    Article  MathSciNet  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. Baader, F., Calvanese, D., Mcguinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  4. Bellodi, E., Gavanelli, M., Zese, R., Lamma, E., Riguzzi, F.: Nonground abductive logic programming with probabilistic integrity constraints. Theory Pract. Logic Program. 21(5), 557–574 (2021). https://doi.org/10.1017/S1471068421000417

    Article  MathSciNet  MATH  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). https://doi.org/10.1016/j.artint.2014.12.010

    Article  MathSciNet  Google Scholar 

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

  7. Brachman, R.J., Levesque, H.J.: Chapter 9 - structured descriptions. In: Brachman, R.J., Levesque, H.J. (eds.) Knowledge Representation and Reasoning, The Morgan Kaufmann Series in Artificial Intelligence, pp. 155–186. Morgan Kaufmann, San Francisco (2004). https://doi.org/10.1016/B978-155860932-7/50094-7

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

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: ALC+T: a preferential extension of description logics. Fund. Inf. 96, 341–372 (2009). https://doi.org/10.3233/FI-2009-185

    Article  MathSciNet  MATH  Google Scholar 

  12. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Prototypical reasoning with low complexity description logics: preliminary results. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 430–436. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04238-6_38

    Chapter  MATH  Google Scholar 

  13. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Reasoning about typicality in low complexity dls: the logics el\(t_{\text{min}}\) and dl-lite\({}_{\text{ c }}\) t\({}_{\text{ min }}\). In: Walsh, T. (ed.) IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 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

  14. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: A NonMonotonic description logic for reasoning about typicality. Artif. Intell. 195, 165–202 (2013). https://doi.org/10.1016/j.artint.2012.10.004

    Article  MATH  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). https://doi.org/10.1016/j.artint.2015.05.001

    Article  MathSciNet  MATH  Google Scholar 

  16. Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artif. Intell. 55(1), 1–60 (1992). https://doi.org/10.1016/0004-3702(92)90041-U

    Article  MathSciNet  MATH  Google Scholar 

  17. Lieto, A., Perrone, F., Pozzato, G.L., Chiodino, E.: Beyond subgoaling: a dynamic knowledge generation framework for creative problem solving in cognitive architectures. Cogn. Syst. Res. 58, 305–316 (2019)

    Article  Google Scholar 

  18. Lieto, A., Pozzato, G.L.: A description logic framework for commonsense conceptual combination integrating typicality, probabilities and cognitive heuristics. J. Exp. Theor. Artif. Intell. 32(5), 769–804 (2020)

    Article  Google Scholar 

  19. Lieto, A., Pozzato, G.L., Striani, M., Zoia, S., Damiano, R.: DEGARI 2.0: a diversity-seeking, explainable, and affective art recommender for social inclusion. Cogn. Syst. Res. 77, 1–17 (2023). https://doi.org/10.1016/j.cogsys.2022.10.001

    Article  Google Scholar 

  20. Lieto, A., Pozzato, G.L., Zoia, S., Patti, V., Damiano, R.: A commonsense reasoning framework for explanatory emotion attribution, generation and re-classification. Knowl. Based Syst. 227, 107166 (2021)

    Article  Google Scholar 

  21. Lieto, A., et al.: A sensemaking system for grouping and suggesting stories from multiple affective viewpoints in museums. Human-Comput. Interact., 1–35 (2023). https://doi.org/10.1080/07370024.2023.2242355

  22. Lukasiewicz, T.: Expressive probabilistic description logics. Artif. Intell. 172(6–7), 852–883 (2008). https://doi.org/10.1016/j.artint.2007.10.017

    Article  MathSciNet  MATH  Google Scholar 

  23. Peirce, C.S.: Philosophical Writings of Peirce. Dover Publications, New York (1955)

    Google Scholar 

  24. Pozzato, G.L.: Reasoning in description logics with typicalities and probabilities of exceptions. In: Antonucci, A., Cholvy, L., Papini, O. (eds.) ECSQARU 2017. LNCS (LNAI), vol. 10369, pp. 409–420. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61581-3_37

    Chapter  MATH  Google Scholar 

  25. Pozzato, G.: Typicalities and probabilities of exceptions in nonmotonic Description Logics. Int. J. Approx. Reason. 107, 81–100 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  26. Riguzzi, F., Bellodi, E., Lamma, E., Zese, R.: Probabilistic description logics under the distribution semantics. Semant. Web 6(5), 477–501 (2015)

    Article  MATH  Google Scholar 

  27. Riguzzi, F., Bellodi, E., Lamma, E., Zese, R.: Probabilistic description logics under the distribution semantics. Semant. Web 6, 477–501 (2015). https://doi.org/10.3233/SW-140154

    Article  MATH  Google Scholar 

  28. Riguzzi, F., Bellodi, E., Lamma, E., Zese, R.: Reasoning with probabilistic ontologies. In: Yang, Q., Wooldridge, M. (eds.) Proceedings of IJCAI 2015, pp. 4310–4316. AAAI Press (2015). https://ijcai.org/proceedings/2015

  29. Strasser, C., Antonelli, G.A.: Non-monotonic logic. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Stanford University, Metaphysics Research Lab (2018)

    Google Scholar 

  30. Studer, R., Benjamins, V., Fensel, D.: Knowledge engineering: principles and methods. Data Knowl. Eng. 25(1), 161–197 (1998). https://doi.org/10.1016/S0169-023X(97)00056-6

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gian Luca Pozzato .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pozzato, G.L., Spinnicchia, M. (2023). A Defeasible Description Logic for Abduction. In: Basili, R., Lembo, D., Limongelli, C., Orlandini, A. (eds) AIxIA 2023 – Advances in Artificial Intelligence. AIxIA 2023. Lecture Notes in Computer Science(), vol 14318. Springer, Cham. https://doi.org/10.1007/978-3-031-47546-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-47546-7_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-47545-0

  • Online ISBN: 978-3-031-47546-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics