{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:24:30Z","timestamp":1725809070075},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135595"},{"type":"electronic","value":"9783319135601"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13560-1_47","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T05:24:07Z","timestamp":1415942647000},"page":"587-599","source":"Crossref","is-referenced-by-count":9,"title":["On Adding Inverse Features to the Description Logic $\\mathcal{CFD}^{\\forall}_{nc}$"],"prefix":"10.1007","author":[{"given":"David","family":"Toman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grant","family":"Weddell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","first-page":"1","volume":"36","author":"A. Artale","year":"2009","unstructured":"Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. AI Research\u00a036, 1\u201369 (2009)","journal-title":"J. AI Research"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BFb0019913","volume-title":"Conceptual Modeling - ER \u201996","author":"J. Biskup","year":"1996","unstructured":"Biskup, J., Menzel, R., Polle, T., Sagiv, Y.: Decomposition of Relationships through Pivoting. In: Thalheim, B. (ed.) ER 1996. LNCS, vol.\u00a01157, pp. 28\u201341. Springer, Heidelberg (1996)"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-46564-2_3","volume-title":"Foundations of Information and Knowledge Systems","author":"J. Biskup","year":"2000","unstructured":"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.\u00a01762, pp. 31\u201349. Springer, Heidelberg (2000)"},{"key":"47_CR4","unstructured":"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\u2013241 (2008)"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1609\/aaai.v28i1.8867"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, Thatcher (eds.) Complexity of Computer Computations. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"47_CR7","unstructured":"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\u2013346 (2007)"},{"key":"47_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/3-540-44957-4_68","volume-title":"Computational Logic - CL 2000","author":"V.L. Khizder","year":"2000","unstructured":"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.\u00a01861, pp. 1017\u20131032. Springer, Heidelberg (2000)"},{"key":"47_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44503-X_4","volume-title":"Database Theory - ICDT 2001","author":"V.L. Khizder","year":"2001","unstructured":"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.\u00a01973, pp. 54\u201367. Springer, Heidelberg (2001)"},{"key":"47_CR10","unstructured":"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.\u00a049, pp. 76\u201385 (2001)"},{"issue":"1","key":"47_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.tcs.2004.10.036","volume":"336","author":"D. Toman","year":"2005","unstructured":"Toman, D., Weddell, G.: On Reasoning about Structural Equality in XML: A Description Logic Approach. Theoretical Computer Science\u00a0336(1), 181\u2013203 (2005)","journal-title":"Theoretical Computer Science"},{"key":"47_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/11814771_52","volume-title":"Automated Reasoning","author":"D. Toman","year":"2006","unstructured":"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.\u00a04130, pp. 647\u2013661. Springer, Heidelberg (2006)"},{"key":"47_CR13","unstructured":"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\u2013608 (2005)"},{"issue":"2-3","key":"47_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10817-007-9092-z","volume":"40","author":"D. Toman","year":"2008","unstructured":"Toman, D., Weddell, G.E.: On keys and functional dependencies as first-class citizens in description logics. J. Aut. Reasoning\u00a040(2-3), 117\u2013132 (2008)","journal-title":"J. Aut. Reasoning"},{"key":"47_CR15","unstructured":"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\u2013954 (2009)"},{"key":"47_CR16","series-title":"LNCS (LNAI)","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-319-03680-9_36","volume-title":"AI 2013: Advances in Artificial Intelligence","author":"D. Toman","year":"2013","unstructured":"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.\u00a08272, pp. 350\u2013361. Springer, Heidelberg (2013)"},{"key":"47_CR17","unstructured":"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)"},{"key":"47_CR18","unstructured":"Toman, D., Weddell, G.E.: Pushing the ${\\mathcal CFD}_{nc}$ Envelope. In: International Workshop on Description Logics, DL 2014 (2014)"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2014: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13560-1_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T23:56:24Z","timestamp":1689638184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13560-1_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135595","9783319135601"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13560-1_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}