Skip to main content

Advertisement

Springer Nature Link
Log in

ExpTime Tableaux for Using Sound Global Caching

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We present a simple ExpTime (complexity-optimal) tableau decision procedure based on and-or graphs with sound global caching for checking satisfiability of a concept w.r.t. a TBox in \(\mathcal{ALC}\). Our algorithm is easy to implement and provides a foundation for ExpTime (complexity-optimal) tableau-based decision procedures for many modal and description logics, to which various optimisation techniques can be applied.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Baader, F., Buchheit, M., Hollunder, B.: Cardinality restrictions on concepts. Artif. Intell. 88(1–2), 195–213 (1996)

    Article  MATH  Google Scholar 

  2. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. CUP (2003)

  3. Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Stud. Log. 69, 5–40 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Beth, E.W.: On Padoa’s method in the theory of definition. Indag. Math. 15, 330–339 (1953)

    MathSciNet  Google Scholar 

  5. De Giacomo, G., Donini, F.M., Massacci, F.: Exptime tableaux for ALC. In: Proc. of Description Logics’1996. AAAI Tech. Report, vol. WS-96-05, pp. 107–110. AAAI Press (1996)

  6. Ding, Y., Haarslev, V.: Tableau caching for description logics with inverse and transitive roles. In: Proc. DL’2006, pp. 143–149 (2006)

  7. Donini, F., Massacci, F.: EXPTIME tableaux for \(\mathcal{ALC}\). Artif. Intell. 124, 87–138 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dunin-Kȩplicz, B., Nguyen, L.A., Szałas, A.: Converse-PDL with regular inclusion axioms: a framework for MAS logics. J. Appl. Non-Class. Log. 21(1), 61–81 (2011)

    Article  Google Scholar 

  9. Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18, 194–211 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  10. Goré, R.: Tableau methods for modal and temporal logics. In: D’Agostino et al. (eds.) Handbook of Tableau Methods, pp. 297–396. Kluwer (1999)

  11. Goré, R., Kupke, C., Pattinson, D., Schröder, L.: Global caching for coalgebraic description logics. In: Proc. IJCAR’2010. LNCS, vol. 6173, pp. 46–60. Springer (2010)

  12. Goré, R., Nguyen, L.A.: ExpTime tableaux for \(\mathcal{ALC}\) using sound global caching. In: Calvanese, D. et al. (eds.) Proc. DL’2007, pp. 299–306 (2007)

  13. Goré, R., Nguyen, L.A.: EXPTIME tableaux with global caching for description logics with transitive roles, inverse roles and role hierarchies. In: Olivetti, N. (ed.) Proc. TABLEAUX’2007. LNCS, vol. 4548, pp. 133–148. Springer (2007)

  14. Goré, R., Nguyen, L.A.: Optimised ExpTime tableaux for \(\mathcal{ALC}\) using sound global caching, propagation and cutoffs. Manuscript, http://www.mimuw.edu.pl/~nguyen/GoreNguyenALC.pdf (2007). Accessed 2 July 2007

  15. Goré, R., Nguyen, L.A.: Analytic cut-free tableaux for regular modal logics of agent beliefs. In: Sadri, F., Satoh, K. (eds.) Proc. CLIMA VIII. LNAI, vol. 5056, pp. 268–287. Springer (2008)

  16. Goré, R., Postniece, L.: An experimental evaluation of global caching for ALC (system description). In: Baumgartner, P. (ed.) Proc. IJCAR’2008. LNCS, vol. 5195, pp. 299–305. Springer (2008)

  17. Goré, R., Widmann, F.: An optimal on-the-fly tableau-based decision procedure for PDL-satisfiability. In: Schmidt, R.A. (ed.) Proc. CADE’2009. LNAI, vol. 5663, pp. 437–452. Springer (2009)

  18. Goré, R., Widmann, F.: Sound global state caching for ALC with inverse roles. In: Giese, M., Waaler, A. (eds.) Proc. TABLEAUX’2009. LNAI, vol. 5607, pp. 205–219. Springer (2009)

  19. Goré, R., Widmann, F.: Optimal and cut-free tableaux for propositional dynamic logic with converse. In: Proc. IJCAR’2010. LNCS, vol. 6173, pp. 225–239. Springer (2010)

  20. Haarslav, V., Möller, R.: Consistency testing: the RACE experience. In: Dyckhoff, R. (ed) Proc. TABLEAUX’2000. LNCS, vol. 1847, pp. 57–61. Springer (2000)

  21. Heuerding, A., Seyfried, M., Zimmermann, H.: Efficient loop-check for backward proof search in some non-classical logics. In: Proc. TABLEAUX’1996. LNAI, vol. 1071, pp. 210–225. Springer (1996)

  22. Horrocks, I., Patel-Schneider, P.F.: Optimizing description logic subsumption. J. Log. Comput. 9(3), 267–293 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  23. Horrocks, I., Sattler, U.: A description logic with transitive and inverse roles and role hierarchies. J. Log. Comput. 9(3), 385–410 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  24. Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. Logic Journal of the IGPL 8(3), 239–263 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  25. Schaerf, A., Buchheit, M., Donini, F.M.: Decidable reasoning in terminological knowledge representation systems. J. Artif. Intell. Res. 1(1–2), 109–138 (1993)

    MathSciNet  MATH  Google Scholar 

  26. Motik, B., Shearer, R., Horrocks, I.: Optimized reasoning in description logics using hypertableaux. In: Pfenning, F. (ed.) Proc. of CADE-21. LNCS, vol. 4603, pp. 67–83. Springer (2007)

  27. Nguyen, L.A.: Analytic tableau systems and interpolation for the modal logics KB, KDB, K5, KD5. Stud. Log. 69(1), 41–57 (2001)

    Article  MATH  Google Scholar 

  28. Nguyen, L.A.: An efficient tableau prover using global caching for the description logic ALC. Fundam. Inform. 93(1–3), 273–288 (2009)

    MATH  Google Scholar 

  29. Nguyen, L.A.: A cut-free exptime tableau decision procedure for the logic extending converse-PDL with regular inclusion axioms. CoRR, abs/1104.0405 (2011). Accessed 3 April 2011

  30. Nguyen, L.A.: Cut-free exptime tableaux for checking satisfiability of a knowledge base in the description logic ALCI. In: Proc. ISMIS’2011. LNCS, vol. 6804, pp. 465–475. Springer (2011)

  31. Nguyen, L.A.: A cut-free exptime tableau decision procedure for the description logic SHI. In: Proc. ICCCI’2011. LNAI, vol. 6922, pp. 572–581. Springer (2011). (see http://arxiv.org/abs/1106.2305 for a long version).

  32. Nguyen, L.A., Szałas, A.: EXPTIME tableaux for checking satisfiability of a knowledge base in the description logic ALC. In: Nguyen, N.T., Kowalczyk, R., Chen, S.-M. (eds.) Proc. ICCCI’2009. LNAI, vol. 5796, pp. 437–448. Springer (2009)

  33. Nguyen, L.A., Szałas, A.: An optimal tableau decision procedure for Converse-PDL. In: Nguyen, N.-T., Bui, T.-D., Szczerbicki, E., Nguyen, N.-B. (eds.) Proc. KSE’2009, pp. 207–214. IEEE Computer Society (2009)

  34. Nguyen, L.A., Szałas, A.: A tableau calculus for regular grammar logics with converse. In: Schmidt, R.A. (ed.) Proc. CADE-22. LNAI, vol. 5663, pp. 421–436. Springer-Verlag (2009)

  35. Nguyen, L.A., Szałas, A.: Checking consistency of an ABox w.r.t. global assumptions in PDL. Fundam. Inform. 102(1), 97–113 (2010)

    MATH  Google Scholar 

  36. Nguyen, L.A., Szałas, A.: Tableaux with global caching for checking satisfiability of a knowledge base in the description logic SH. Transactions on Computational Collective Intelligence 1, 21–38 (2010)

    Article  Google Scholar 

  37. Nguyen, L.A., Szałas, A.: ExpTime tableau decision procedures for regular grammar logics with converse. Stud. Log. 98(3), 387–428 (2011)

    Article  MATH  Google Scholar 

  38. Pratt, V.R.: A near-optimal method for reasoning about action. J. Comput. Syst. Sci. 20(2), 231–254 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  39. Rautenberg, W.: Modal tableau calculi and interpolation. J. Philos. Logic 12, 403–423 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  40. Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Mylopoulos, J., Reiter, R. (eds.) Proc. IJCAI’1991, pp. 466–471. Morgan Kaufmann (1991)

Download references

Author information

Authors and Affiliations

  1. Logic and Computation Group, Research School of Information Sciences and Engineering, College of Engineering and Computer Science, The Australian National University, Canberra, ACT 0200, Australia

    Rajeev Goré

  2. Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland

    Linh Anh Nguyen

Authors
  1. Rajeev Goré
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Linh Anh Nguyen
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Rajeev Goré.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goré, R., Nguyen, L.A. ExpTime Tableaux for Using Sound Global Caching. J Autom Reasoning 50, 355–381 (2013). https://doi.org/10.1007/s10817-011-9243-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-011-9243-0

Keywords