Abstract
We consider how inverse features can be added to the description logic \(\mathcal{CFD}^{\forall}_{nc}\), a feature-based dialect with PTIME algorithms for various reasoning tasks over \(\mathcal{CFD}^{\forall}_{nc}\) knowledge bases. We show how a straightforward addition of unqualified inverse features makes the tasks of reasoning about logical consequences and about knowledge base consistency intractable. We then present syntactic restrictions on \(\mathcal{CFD}^{\forall}_{nc}\) knowledge bases that relate to combinations of value restrictions and inverses and to combinations of value restrictions and path functional dependencies, and show how such restrictions lead to PTIME algorithms for both tasks. Finally, we show how the resulting dialect called \(\mathcal{CFDI}^{\forall-}_{nc}\) can be used to address performance issues relating to relational data sources as well as RDF data sources conforming to DL-Lite\(^{\mathcal F}_{\mathrm{core}}\), a description logic dialect of relevance to the W3C OWL 2 QL profile.
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
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. AI Research 36, 1–69 (2009)
Biskup, J., Menzel, R., Polle, T., Sagiv, Y.: Decomposition of Relationships through Pivoting. In: Thalheim, B. (ed.) ER 1996. LNCS, vol. 1157, pp. 28–41. Springer, Heidelberg (1996)
Biskup, J., Polle, T.: Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints. In: Schewe, K.-D., Thalheim, B. (eds.) FoIKS 2000. LNCS, vol. 1762, pp. 31–49. Springer, Heidelberg (2000)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Path-based identification constraints in description logics. In: Brewka, G., Lang, J. (eds.) KR, pp. 231–241 (2008)
Calvanese, D., Fischl, W., Pichler, R., Sallinger, E., Simkus, M.: Capturing Relational Schemas and Functional Dependencies in RDFS. To appear in Proc. Nat. Conf. on Artificial Intelligence, AAAI (2014)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, Thatcher (eds.) Complexity of Computer Computations. Plenum Press (1972)
Khizder, V., Toman, D., Weddell, G.E.: Adding ABoxes to a Description Logic with Uniqueness Constraints via Path Agreements. In: Proc. International Workshop on Description Logics, DL 2007, pp. 339–346 (2007)
Khizder, V.L., Toman, D., Weddell, G.: Reasoning about Duplicate Elimination with Description Logic (Preliminary Report). In: LIoyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 1017–1032. Springer, Heidelberg (2000)
Khizder, V.L., Toman, D., Weddell, G.: On Decidability and Complexity of Description Logics with Uniqueness Constraints. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 54–67. Springer, Heidelberg (2001)
Toman, D., Weddell, G.: On Attributes, Roles, and Dependencies in Description Logics and the Ackermann Case of the Decision Problem. In: Description Logics 2001. CEUR-WS, vol. 49, pp. 76–85 (2001)
Toman, D., Weddell, G.: On Reasoning about Structural Equality in XML: A Description Logic Approach. Theoretical Computer Science 336(1), 181–203 (2005)
Toman, D., Weddell, G.: On Keys and Functional Dependencies as First-Class Citizens in Description Logics. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 647–661. Springer, Heidelberg (2006)
Toman, D., Weddell, G.E.: On the interaction between inverse features and path-functional dependencies in description logics. In: Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 603–608 (2005)
Toman, D., Weddell, G.E.: On keys and functional dependencies as first-class citizens in description logics. J. Aut. Reasoning 40(2-3), 117–132 (2008)
Toman, D., Weddell, G.E.: Applications and extensions of PTIME description logics with functional constraints. In: Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 948–954 (2009)
Toman, D., Weddell, G.: Conjunctive Query Answering in \({\mathcal{CFD}}_{nc}\): A PTIME Description Logic with Functional Constraints and Disjointness. In: Cranefield, S., Nayak, A. (eds.) AI 2013. LNCS (LNAI), vol. 8272, pp. 350–361. Springer, Heidelberg (2013)
Toman, D., Weddell, G.E.: Answering Queries over \({\mathcal CFD}^{\forall}_{nc}\) Knowledge Bases. Technical Report CS-2014-14, Cheriton School of Computer Science, University of Waterloo (2014)
Toman, D., Weddell, G.E.: Pushing the \({\mathcal CFD}_{nc}\) Envelope. In: International Workshop on Description Logics, DL 2014 (2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Toman, D., Weddell, G. (2014). On Adding Inverse Features to the Description Logic \(\mathcal{CFD}^{\forall}_{nc}\) . In: Pham, DN., Park, SB. (eds) PRICAI 2014: Trends in Artificial Intelligence. PRICAI 2014. Lecture Notes in Computer Science(), vol 8862. Springer, Cham. https://doi.org/10.1007/978-3-319-13560-1_47
Download citation
DOI: https://doi.org/10.1007/978-3-319-13560-1_47
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13559-5
Online ISBN: 978-3-319-13560-1
eBook Packages: Computer ScienceComputer Science (R0)