Abstract
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extension. So-called general concept inclusions (GCIs) play an important role for capturing background knowledge. It is well-known that, when combining concrete domains with GCIs, reasoning easily becomes undecidable. In this paper, we identify a general property of concrete domains that is sufficient for proving decidability of DLs with both concrete domains and GCIs. We exhibit some useful concrete domains, most notably a spatial one based on the RCC-8 relations, which have this property. Then, we present a tableau algorithm for reasoning in DLs equipped with concrete domains and GCIs.
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
Allen, J.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11) (1983)
Baader, F., Hanschke, P.: A scheme for integrating concrete domains into concept languages. In: Proc. of IJCAI 1991, pp. 452–457. Morgan Kaufman, San Francisco (1991)
Baader, F., Horrocks, I., Sattler, U.: Description logics as ontology languages for the semantic web. In: Festschrift in honor of Jörg Siekmann. LNCS (LNAI). Springer, Heidelberg (2003)
Baader, F., McGuiness, D.L., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press, Cambridge (2003)
Balbiani, P., Condotta, J.-F.: Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In: Armando, A. (ed.) FroCos 2002. LNCS (LNAI), vol. 2309, pp. 162–176. Springer, Heidelberg (2002)
Bennett, B.: Modal logics for qualitative spatial reasoning. Journal of the IGPL 4(1) (1997)
Calvanese, D.: Reasoning with inclusion axioms in description logics: Algorithms and complexity. In: Proc. of ECAI 1996, pp. 303–307 (1996)
Calvanese, D., Lenzerini, M., Nardi, D.: Description logics for conceptual data modeling. In: Logics for Databases and Information Systems, pp. 229–263. Kluwer, Dordrecht (1998)
Gabbay, D.M., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Elsevier, Amsterdam (2003)
Haarslev, V., Möller, R.: RACER system description. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 701–705. Springer, Heidelberg (2001)
Horrocks, I.: Using an expressive description logic: Fact or fiction? In: Proc. of KR 1998, pp. 636–647 (1998)
Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for expressive description logics. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS (LNAI), vol. 1705, pp. 161–180. Springer, Heidelberg (1999)
Lutz, C.: Complexity of terminological reasoning revisited. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS (LNAI), vol. 1705, pp. 181–200. Springer, Heidelberg (1999)
Lutz, C.: Adding numbers to the \({\mathcal SHIQ}\) description logic—First results. In: Proc. of KR 2002, pp. 191–202. Morgan Kaufman, San Francisco (2002)
Lutz, C.: Reasoning about entity relationship diagrams with complex attribute dependencies. In: Proc. of DL2002, CEUR-WS, vol. 53, pp. 185–194 (2002), http://ceur-ws.org/
Lutz, C.: Description logics with concrete domains—a survey. In: Advances in Modal Logics, vol. 4, pp. 265–296. King’s College Publications (2003)
Lutz, C.: Combining interval-based temporal reasoning with general tboxes. Artificial Intelligence 152(2), 235–274 (2004)
Lutz, C.: NExpTime-complete description logics with concrete domains. ACM Transactions on Computational Logic 5(4), 669–705 (2004)
Lutz, C., Miličić, M.: A tableau algorithm for DLs with concrete domains and GCIs. LTCS-Report 05-07, TU Dresden (2005), See http://lat.inf.tu-dresden.de/research/reports.html
Randell, D.A., Cui, Z., Cohn, A.G.: A spatial logic based on regions and connection. In: Proc. of KR 1992, pp. 165–176. Morgan Kaufman, San Francisco (1992)
Renz, J., Nebel, B.: On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus. Artificial Intelligence 108(1–2), 69–123 (1999)
Vilain, M., Kautz, H., van Beek, P.: Constraint propagation algorithms for temporal reasoning: a revised report. In: Readings in qualitative reasoning about physical systems, pp. 373–381. Morgan Kaufmann, San Francisco (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lutz, C., Miličić, M. (2005). A Tableau Algorithm for Description Logics with Concrete Domains and GCIs. In: Beckert, B. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2005. Lecture Notes in Computer Science(), vol 3702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554554_16
Download citation
DOI: https://doi.org/10.1007/11554554_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28931-9
Online ISBN: 978-3-540-31822-4
eBook Packages: Computer ScienceComputer Science (R0)