Abstract
We give the first direct cut-free ExpTime (optimal) tableau decision procedure, which is not based on transformation or on the pre-completion technique, for checking satisfiability of a knowledge base in the description logic \(\mathcal{ALCI}\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ding, Y., Haarslev, V., Wu, J.: A new mapping from \(\mathcal{ALCI}\) to \(\mathcal{ALC}\). In: Proceedings of Description Logics (2007)
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)
Goré, R.P., 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)
Goré, R., Widmann, F.: Sound global state caching for ALC with inverse roles. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol. 5607, pp. 205–219. Springer, Heidelberg (2009)
Goré, R., Widmann, F.: Optimal and cut-free tableaux for propositional dynamic logic with converse. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 225–239. Springer, Heidelberg (2010)
Horrocks, I., Sattler, U.: Description logics - basics, applications, and more. In: Tutorial Given at ECAI-2002, http://www.cs.man.ac.uk/~horrocks/Slides/ecai-handout.pdf
Nguyen, L.A.: An efficient tableau prover using global caching for the description logic {ALC}. Fundamenta Informaticae 93(1-3), 273–288 (2009)
Nguyen, L.A.: The long version of the current paper (2011), http://www.mimuw.edu.pl/~nguyen/alci-long.pdf
Nguyen, L.A., Szałas, A.: expTime tableaux for checking satisfiability of a knowledge base in the description logic \(\mathcal{ALC}\). In: Nguyen, N.T., Kowalczyk, R., Chen, S.-M. (eds.) ICCCI 2009. LNCS(LNAI), vol. 5796, pp. 437–448. Springer, Heidelberg (2009)
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.) Proceedings of KSE 2009, pp. 207–214. IEEE Computer Society, Los Alamitos (2009)
Nguyen, L.A., Szałas, A.: A tableau calculus for regular grammar logics with converse. In: Schmidt, R.A. (ed.) CADE-22. LNCS(LNAI), vol. 5663, pp. 421–436. Springer, Heidelberg (2009)
Nguyen, L.A., Szałas, A.: Checking consistency of an ABox w.r.t. global assumptions in PDL. Fundamenta Informaticae 102(1), 97–113 (2010)
Nguyen, L.A., Szałas, A.: Tableaux with global caching for checking satisfiability of a knowledge base in the description logic \(\mathcal{SH}\). T. Computational Collective Intelligence 1, 21–38 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, L.A. (2011). Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic \(\mathcal{ALCI}\) . In: Kryszkiewicz, M., Rybinski, H., Skowron, A., Raś, Z.W. (eds) Foundations of Intelligent Systems. ISMIS 2011. Lecture Notes in Computer Science(), vol 6804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21916-0_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-21916-0_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21915-3
Online ISBN: 978-3-642-21916-0
eBook Packages: Computer ScienceComputer Science (R0)