Abstract
Goré and Nguyen have recently given the first optimal and sound method for global caching for the description (modal) logic \(\mathcal {ALC}\), and various extensions. We report on an experimental evaluation for \(\mathcal {ALC}\) plus its reflexive and reflexive-transitive extensions which compares global caching, mixed caching, unsat caching and no caching, all in a single common framework implementing a depth-first search strategy. We also evaluated a version of global caching using an unrestricted search strategy which necessarily sits outside the common framework. We conclude that global caching is an improvement over the other methods in most but not all cases.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Donini, F., Massacci, F.: EXPTIME tableaux for \(\mathcal{ALC}\). AIJ 124, 87–138 (2000)
Goré, R., Nguyen, L.A.: Exptime tableaux for ALC using sound global caching. In: Proc. DL 2007 (June 2007), http://dl.kr.org/dl2007/
Heuerding, A., Schwendimann, S.: A benchmark method for the propositional logics K, KT, S4. Technical report, Universitaet Bern, Switzerland (1996)
Horrocks, I., Patel-Schneider, P.F.: Optimizing description logic subsumption. Journal of Logic and Computation 9(3), 267–293 (1999)
Tsarkov, D., Horrocks, I., Patel-Schneider, P.F.: Optimizing terminological reasoning for expressive description logics. JAR 39(3), 277–316 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goré, R., Postniece, L. (2008). An Experimental Evaluation of Global Caching for \(\mathcal {ALC}\) (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds) Automated Reasoning. IJCAR 2008. Lecture Notes in Computer Science(), vol 5195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71070-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-71070-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71069-1
Online ISBN: 978-3-540-71070-7
eBook Packages: Computer ScienceComputer Science (R0)