Skip to main content

PreDeLo 1.0: A Theorem Prover for Preferential Description Logics

  • Conference paper
AI*IA 2013: Advances in Artificial Intelligence (AI*IA 2013)

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

Included in the following conference series:

Abstract

We describe PreDeLo 1.0, a theorem prover for preferential Description Logics (DLs). These are nonmonotonic extensions of standard DLs based on a typicality operatorT, which enjoys a preferential semantics. PreDeLo 1.0 is a Prolog implementation of labelled tableaux calculi for such extensions, and it is able to deal with the preferential extension of the basic DL \(\mathcal{ALC}\) as well as with the preferential extension of the lightweight DL DL − Lite core . The Prolog implementation is inspired by the “lean” methodology, whose basic idea is that each axiom or rule of the tableaux calculi is implemented by a Prolog clause of the program. Concerning \(\mathcal{ALC}\), PreDeLo 1.0 considers two extensions based, respectively, on Kraus, Lehmann and Magidor’s preferential and rational entailment. In this paper, we also introduce a tableaux calculus for checking entailment in the rational extension of \(\mathcal{ALC}\).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Beckert, B., Posegga, J.: leantap: Lean tableau-based deduction. JAR 15(3), 339–358 (1995)

    Article  MathSciNet  MATH  Google Scholar 

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

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

  5. Calvanese, D., Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in DLs: the DL-Lite family. J. Autom. Reas. 39(3), 385–429 (2007)

    Article  MATH  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. Donini, F.M., Nardi, D., Rosati, R.: Description logics of minimal knowledge and negation as failure. ACM Trans. Comput. Log. 3(2), 177–225 (2002)

    Article  MathSciNet  Google Scholar 

  8. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: A tableaux calculus for \(\mathcal{ALC}+{\rm T}_{min}\) R, Tech. rep. (2013), http://www.di.unito.it/~pozzato/tralctrm.pdf

  9. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: A nonmonotonic Description Logic for reasoning about typicality. Artificial Intelligence 195, 165–202 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  10. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Reasoning about typicality in low complexity DLs: the logics \(\mathcal{EL}^{\bot}{\rm T}_{min}\) and DL-lite c T min . In: IJCAI, pp. 894–899 (2011)

    Google Scholar 

  11. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: A tableau calculus for a nonmonotonic extension of the Description Logic \(\mbox{\em DL-Lite}_{\mathit{core}}\). In: Pirrone, R., Sorbello, F. (eds.) AI*IA 2011. LNCS, vol. 6934, pp. 164–176. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: A tableau calculus for a nonmonotonic extension of \(\mathcal{EL}^\bot\). In: Brünnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS, vol. 6793, pp. 180–195. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Preferential vs Rational Description Logics: which one for Reasoning About Typicality? In: ECAI, pp. 1069–1070 (2010)

    Google Scholar 

  14. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: \(\mathcal{ALC}+{\rm T}_{min}\): a preferential extension of Description Logics. Fundamenta Informaticae 96, 1–32 (2009)

    MathSciNet  Google Scholar 

  15. Kraus, S., Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artificial Intelligence 55(1), 1–60 (1992)

    Article  MathSciNet  Google Scholar 

  16. Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44(1-2), 167–207 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Giordano, L., Gliozzi, V., Jalal, A., Olivetti, N., Pozzato, G.L. (2013). PreDeLo 1.0: A Theorem Prover for Preferential Description Logics. In: Baldoni, M., Baroglio, C., Boella, G., Micalizio, R. (eds) AI*IA 2013: Advances in Artificial Intelligence. AI*IA 2013. Lecture Notes in Computer Science(), vol 8249. Springer, Cham. https://doi.org/10.1007/978-3-319-03524-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03524-6_6

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03523-9

  • Online ISBN: 978-3-319-03524-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics