Skip to main content
SpringerLink
Log in

ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic \(\mathcal{ALC}\)

  • Conference paper
Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems (ICCCI 2009)

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

Included in the following conference series:

Abstract

We give the first ExpTime (optimal) tableau decision procedure for checking satisfiability of a knowledge base in the description logic \(\mathcal{ALC}\), not based on transformation that encodes ABoxes by nominals or terminology axioms. Our procedure can be implemented as an extension of the highly optimized tableau prover TGC [12] to obtain an efficient program for the mentioned satisfiability problem.

Supported by the grants N N206 3982 33 and N N206 399334 from the Polish Ministry of Science and Higher Education.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica 69, 5–40 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Donini, F., Massacci, F.: ExpTime tableaux for \(\mathcal{ALC}\). Artificial Intelligence 124, 87–138 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. De Giacomo, G.: Decidability of Class-Based Knowledge Representation Formalisms. PhD thesis, Universita’ di Roma “La Sapienza” (1995)

    Google Scholar 

  4. De Giacomo, G., Lenzerini, M.: TBox and ABox reasoning in expressive description logics. In: Aiello, L.C., Doyle, J., Shapiro, S.C. (eds.) Proceedings of KR 1996, pp. 316–327. Morgan Kaufmann, San Francisco (1996)

    Google Scholar 

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

    Chapter  Google Scholar 

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

    Google Scholar 

  7. 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.) TABLEAUX 2007. LNCS (LNAI), vol. 4548, pp. 133–148. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

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

  9. Goré, R., Nguyen, L.A.: Sound global caching for abstract modal tableaux. In: Burkhard, H.-D., et al. (eds.) Proceedings of CS&P 2008, pp. 157–167 (2008)

    Google Scholar 

  10. Horrocks, I., Patel-Schneider, P.F.: Optimizing description logic subsumption. Journal of Logic and Computation 9(3), 267–293 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Horrocks, I., Sattler, U.: Description logics - basics, applications, and more. Tutorial given at ECAI-2002 (2002), http://www.cs.man.ac.uk/~horrocks/Slides/ecai-handout.pdf

  12. Nguyen, L.A.: An efficient tableau prover using global caching for the description logic \(\mathcal{ALC}\). In: Proceedings of CS&P 2008 (2008) (to appear in Fundamenta Informaticae)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Nguyen, L.A., Szałas, A.: Optimal tableau decision procedures for PDL. CoRR, abs/0904.0721 (2009)

    Google Scholar 

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

  16. Rautenberg, W.: Modal tableau calculi and interpolation. JPL 12, 403–423 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  17. Schild, K.: A correspondence theory for terminological logics: Preliminary report. In: Mylopoulos, J., Reiter, R. (eds.) Proceedings of IJCAI 1991, pp. 466–471. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Linh Anh Nguyen & Andrzej Szałas

  2. Dept. of Computer and Information Science, Linköping University, SE, 581 83, Linköping, Sweden

    Andrzej Szałas

Authors
  1. Linh Anh Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Szałas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Wroclaw University of Technology, Str. Janiszweskiego 11/17, 50-370, Wroclaw, Poland

    Ngoc Thanh Nguyen

  2. Centre for Complex Software Systems and Services, Swinburne University of Technology, Hawthorn, P.O. Box 218, 3122, Victoria, Australia

    Ryszard Kowalczyk

  3. Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, G#43, Sec. 4, Keelung Rd, 106, Taipei, Taiwan, R.O.C.

    Shyi-Ming Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nguyen, L.A., Szałas, A. (2009). ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic \(\mathcal{ALC}\) . In: Nguyen, N.T., Kowalczyk, R., Chen, SM. (eds) Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems. ICCCI 2009. Lecture Notes in Computer Science(), vol 5796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04441-0_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04441-0_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04440-3

  • Online ISBN: 978-3-642-04441-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation