Abstract
We consider the instance checking problem for \(\mathcal {SHIQ(\mathbf {D})}\) knowledge bases. In particular, we present a procedure that significantly reduces the number of ABox individuals that need to be examined for a given instance checking problem over a consistent \(\mathcal {SHIQ(\mathbf {D})}\) knowledge base that contains arbitrary occurrences of value restrictions. The procedure extends earlier work that assumed value restrictions were predominantly used to establish global domain and range restrictions, and, consequently, in which other applications of value restrictions had a significant risk of requiring an infeasible number of individuals to be examined for a given problem. Finally, experimental results are given that validate the effectiveness of the procedure.
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
Notes
- 1.
This can be an important feature in cases for which a consistency check when “loading \(\mathcal{K}\)” would constitute a significant overhead due to the size and complexity of an included ontology.
- 2.
Note that unary foreign keys occur in the LUBM benchmark [2] that we appeal to in our experimental evaluation. And indeed, as confirmed by our experimental results, such keys lead to large ripple problems.
- 3.
Also inspired by the Canadian word for a “donut hole” pastry called a Timbit.
- 4.
At a minimum, an interface to a cache of all individual names occurring in \(\mathcal{K}\) would be required, that is, a cache of the result of evaluating the instance query given by \(\mathcal{K}\) and the “top” concept \(\top \).
- 5.
Recall that these are called data property assertions in RDF.
- 6.
We chose to report on experiments using the LUBM benchmark for this study because of its wider appeal, e.g., its adoption of a set of predefined queries, and because its TBox includes foreign key constraints that are not global domain and range restrictions, a property missing with the digital camera case studied in [12]. Additional experiments can be found in [11].
- 7.
References
Dolby, J., Fokoue, A., Kalyanpur, A., Kershenbaum, A., Schonberg, E., Srinivas, K., Ma, L.: Scalable semantic retrieval through summarization and refinement. In: AAAI 2007, pp. 299–304 (2007)
Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for OWL knowledge base systems. Web Semant. 3(2–3), 158–182 (2005)
Haarslev, V., Möller, R.: On the scalability of description logic instance retrieval. J. Autom. Reasoning (JAR) 41(2), 99–142 (2008)
Horrocks, I.: Optimising tableaux decision procedures for description logics. Ph.D. thesis, the University of Manchester (1997)
Horrocks, I., Sattler, U.: Optimised reasoning for \({\cal SHIQ}\). In: ECAI 2002, pp. 277–281 (2002)
Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for expressive description logics. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol. 1705, pp. 161–180. Springer, Heidelberg (1999)
Hudek, A.K., Weddell, G.E.: Binary absorption in tableaux-based reasoning for description logics. In: Description Logics 2006 (2006)
Kollia, I., Glimm, B.: Cost based query ordering over OWL ontologies. In: Cudré-Mauroux, P., Heflin, J., Sirin, E., Tudorache, T., Euzenat, J., Hauswirth, M., Parreira, J.X., Hendler, J., Schreiber, G., Bernstein, A., Blomqvist, E. (eds.) ISWC 2012, Part I. LNCS, vol. 7649, pp. 231–246. Springer, Heidelberg (2012)
Pound, J., Toman, D., Weddell, G.E., Wu, J.: An assertion retrieval algebra for object queries over knowledge bases. In: Walsh, T. (ed.) IJCAI 2011, pp. 1051–1056 (2011)
Wandelt, S., Möller, R.: Towards ABox modularization of semi-expressive description logics. Appl. Ontology 7(2), 133–167 (2012)
Wu, J.: Answering object queries over knowledge bases with expressive underlying description logics. Ph.D. thesis, University of Waterloo (2013)
Jiewen, W., Hudek, A., Toman, D., Weddell, G.: Absorption for ABoxes. J. Autom. Reasoning 53, 215–243 (2014)
Wu, J., Hudek, A.K., Toman, D., Weddell, G.E.: Absorption for ABoxes. In: DL 2012 (2012)
Wu, J., Hudek, A.K., Toman, D., Weddell, G.E.: Assertion absorption in object queries over knowledge bases. In: KR 2012 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Wu, J., Kinash, T., Toman, D., Weddell, G. (2015). Absorption for ABoxes and TBoxes with General Value Restrictions. In: Pfahringer, B., Renz, J. (eds) AI 2015: Advances in Artificial Intelligence. AI 2015. Lecture Notes in Computer Science(), vol 9457. Springer, Cham. https://doi.org/10.1007/978-3-319-26350-2_54
Download citation
DOI: https://doi.org/10.1007/978-3-319-26350-2_54
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26349-6
Online ISBN: 978-3-319-26350-2
eBook Packages: Computer ScienceComputer Science (R0)