{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:37:38Z","timestamp":1726033058016},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030221010"},{"type":"electronic","value":"9783030221027"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22102-7_19","type":"book-chapter","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T08:21:26Z","timestamp":1561450886000},"page":"404-430","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["FunDL"],"prefix":"10.1007","author":[{"given":"Stephanie","family":"McIntyre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Toman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grant","family":"Weddell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/BF01448869","volume":"100","author":"W Ackermann","year":"1928","unstructured":"Ackermann, W.: Uber die Erfullbarkeit gewisser Zahlausdrucke. Math. Ann. 100, 638\u2013649 (1928)","journal-title":"Math. Ann."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.282","volume":"36","author":"A Artale","year":"2009","unstructured":"Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-lite family and relations. J. Artif. Intell. Res. 36, 1\u201369 (2009). https:\/\/doi.org\/10.1613\/jair.282","journal-title":"J. Artif. Intell. Res."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI 2005, Edinburgh, Scotland, UK, 30 July\u20135 August 2005, pp. 364\u2013369. Professional Book Center (2005). http:\/\/ijcai.org\/Proceedings\/05\/Papers\/0372.pdf","DOI":"10.25368\/2022.144"},{"key":"19_CR4","first-page":"1","volume":"66","author":"R Berger","year":"1966","unstructured":"Berger, R.: The undecidability of the dominoe problem. Mem. Amer. Math. Soc. 66, 1\u201372 (1966)","journal-title":"Mem. Amer. Math. Soc."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory. pp. 331\u2013363. Marcel Dekker Inc. (1997)","DOI":"10.1201\/9780429187490-12"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-46397-1_14","volume-title":"Conceptual Modeling","author":"A Borgida","year":"2016","unstructured":"Borgida, A., Toman, D., Weddell, G.: On referring expressions in information systems derived from conceptual modelling. In: Comyn-Wattiau, I., Tanaka, K., Song, I.-Y., Yamamoto, S., Saeki, M. (eds.) ER 2016. LNCS, vol. 9974, pp. 183\u2013197. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46397-1_14"},{"key":"19_CR7","unstructured":"Borgida, A., Toman, D., Weddell, G.E.: On referring expressions in query answering over first order knowledge bases. In: Baral, C., Delgrande, J.P., Wolter, F. (eds.) Proceedings of the Fifteenth International Conference, Principles of Knowledge Representation and Reasoning KR 2016, Cape Town, South Africa, 25\u201329 April 2016, pp. 319\u2013328. AAAI Press (2016). http:\/\/www.aaai.org\/ocs\/index.php\/KR\/KR16\/paper\/view\/12860"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-63792-3_10","volume-title":"Deductive and Object-Oriented Databases","author":"A Borgida","year":"1997","unstructured":"Borgida, A., Weddell, G.: Adding uniqueness constraints to description logics. In: Bry, F., Ramakrishnan, R., Ramamohanarao, K. (eds.) DOOD 1997. LNCS, vol. 1341, pp. 85\u2013102. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63792-3_10"},{"key":"19_CR9","unstructured":"Brewka, G., Lang, J. (eds.): Principles of knowledge representation and reasoning. In: Proceedings of the Eleventh International Conference, KR 2008, Sydney, Australia, 16\u201319 September 2008. AAAI Press (2008)"},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10817-007-9078-x","volume":"39","author":"D Calvanese","year":"2007","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: the DL-Lite family. J. Autom. Reasoning 39(3), 385\u2013429 (2007). https:\/\/doi.org\/10.1007\/s10817-007-9078-x","journal-title":"J. Autom. Reasoning"},{"key":"19_CR11","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Path-based identification constraints in description logics. In: Brewka and Lang [9], pp. 231\u2013241. http:\/\/www.aaai.org\/Library\/KR\/2008\/kr08-023.php"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.artint.2012.10.003","volume":"195","author":"D Calvanese","year":"2013","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Artif. Intell. 195, 335\u2013360 (2013). https:\/\/doi.org\/10.1016\/j.artint.2012.10.003","journal-title":"Artif. Intell."},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Mendelzon, A.O., Paredaens, J. (eds.) Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1\u20133 June 1998, Seattle, Washington, USA. pp. 149\u2013158. ACM Press (1998). https:\/\/doi.org\/10.1145\/275487.275504","DOI":"10.1145\/275487.275504"},{"key":"19_CR14","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M.: Identification constraints and functional dependencies in description logics. In: Nebel, B. (ed.) Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, 4\u201310 August 2001. pp. 155\u2013160. Morgan Kaufmann (2001). http:\/\/ijcai.org\/proceedings\/2001-1"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/151634.151635","volume":"18","author":"J Chomicki","year":"1993","unstructured":"Chomicki, J., Imielinski, T.: Finite representation of infinite query answers. ACM Trans. Database Syst. 18(2), 181\u2013223 (1993). https:\/\/doi.org\/10.1145\/151634.151635","journal-title":"ACM Trans. Database Syst."},{"key":"19_CR16","unstructured":"F\u00fcrer, M.: Alternation and the ackermann case of the decision problem. L\u2019Enseignement Math. 27, 137\u2013162 (1981)"},{"key":"19_CR17","unstructured":"Jacques, J.S., Toman, D., Weddell, G.E.: Object-relational queries over cfdi $${}_{\\text{nc}}$$ knowledge bases: OBDA for the SQL-Literate. In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9\u201315 July 2016, pp. 1258\u20131264. IJCAI\/AAAI Press (2016). http:\/\/www.ijcai.org\/Abstract\/16\/182"},{"key":"19_CR18","unstructured":"Jacques, J.S., Toman, D., Weddell, G.E.: Object-relational queries over cfdi $$\\_$$ nc knowledge bases: OBDA for the SQL-Literate (extended abstract). In: Lenzerini, M., Pe\u00f1aloza, R. (eds.) Proceedings of the 29th International Workshop on Description Logics, Cape Town, South Africa, 22\u201325 April 2016. CEUR Workshop Proceedings, vol. 1577. CEUR-WS.org (2016). http:\/\/ceur-ws.org\/Vol-1577\/paper_10.pdf"},{"key":"19_CR19","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/3-540-44957-4_68","volume-title":"Computational Logic \u2014 CL 2000","author":"VL Khizder","year":"2000","unstructured":"Khizder, V.L., Toman, D., Weddell, G.: Reasoning about duplicate elimination with description logic. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 1017\u20131032. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_68"},{"key":"19_CR21","unstructured":"Khizder, V.L., Toman, D., Weddell, G.E.: Adding aboxes to a description logic with uniqueness constraints via path agreements. In: Calvanese, D., et al. (eds.) Proceedings of the 2007 International Workshop on Description Logics (DL2007), Brixen-Bressanone, near Bozen-Bolzano, Italy, 8\u201310 June 2007. CEUR Workshop Proceedings, vol. 250. CEUR-WS.org (2007). http:\/\/ceur-ws.org\/Vol-250\/paper_69.pdf"},{"key":"19_CR22","unstructured":"Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to query answering in DL-Lite. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) Proceedings of the Twelfth International Conference Principles of Knowledge Representation and Reasoning, KR 2010, Toronto, Ontario, Canada, 9\u201313 May 2010. AAAI Press (2010). http:\/\/aaai.org\/ocs\/index.php\/KR\/KR2010\/paper\/view\/1282"},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"Liu, L., \u00d6zsu, M.T. (eds.): Encyclopedia of Database Systems. Springer, US (2009). https:\/\/doi.org\/10.1007\/978-0-387-39940-9","DOI":"10.1007\/978-0-387-39940-9"},{"key":"19_CR24","unstructured":"Machtey, M., Young, P.: An Introduction to the General Theory of Algorithms. North-Holland, Amsterdam (1978)"},{"key":"19_CR25","unstructured":"McIntyre, S., Borgida, A., Toman, D., Weddell, G.E.: On limited conjunctions in polynomial feature logics, with applications in OBDA. In: Thielscher, M., Toni, F., Wolter, F. (eds.) Proceedings of the Sixteenth International Conference Principles of Knowledge Representation and Reasoning, KR 2018, Tempe, Arizona, 30 October\u20132 November 2018, pp. 655\u2013656. AAAI Press (2018). https:\/\/aaai.org\/ocs\/index.php\/KR\/KR18\/paper\/view\/18016"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"McIntyre, S., Borgida, A., Toman, D., Weddell, G.E.: On limited conjunctions and partial features in parameter tractable feature logics. In: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 27 January\u20131 February 2019, Honolulu, Hawaii, U.S.A. (2019, in press)","DOI":"10.1609\/aaai.v33i01.33012995"},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1007\/978-0-387-39940-9_148","volume-title":"Encyclopedia of Database Systems","author":"Constantine Stephanidis","year":"2009","unstructured":"Song, I., Chen, P.P.: Entity relationship model. In: Liu and \u00d6zsu [23], pp. 1003\u20131009. https:\/\/doi.org\/10.1007\/978-0-387-39940-9_148"},{"key":"19_CR28","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1007\/978-0-387-39940-9_157","volume-title":"Encyclopedia of Database Systems","author":"Constantine Stephanidis","year":"2009","unstructured":"Thalheim, B.: Extended entity-relationship model. In: Liu and \u00d6zsu [23], pp. 1083\u20131091. https:\/\/doi.org\/10.1007\/978-0-387-39940-9_157"},{"key":"19_CR29","unstructured":"Toman, D., Weddell, G.E.: On attributes, roles, and dependencies in description logics and the ackermann case of the decision problem. In: Goble, C.A., McGuinness, D.L., M\u00f6ller, R., Patel-Schneider, P.F. (eds.) Proceedings of the Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, 1\u20133 August 2001. CEUR Workshop Proceedings, vol. 49. CEUR-WS.org (2001). http:\/\/ceur-ws.org\/Vol-49\/TomanWeddell-76start.ps"},{"issue":"1","key":"19_CR30","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.E.: On reasoning about structural equality in XML: a description logic approach. Theor. Comput. Sci. 336(1), 181\u2013203 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.10.036","journal-title":"Theor. Comput. Sci."},{"key":"19_CR31","unstructured":"Toman, D., Weddell, G.E.: On the interaction between inverse features and path-functional dependencies in description logics. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI 2005, Edinburgh, Scotland, UK, 30 July\u20135 August 2005, pp. 603\u2013608. Professional Book Center (2005). http:\/\/ijcai.org\/Proceedings\/05\/Papers\/1421.pdf"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science (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. 4130, pp. 647\u2013661. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814771_52"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-75563-0_21","volume-title":"Conceptual Modeling - ER 2007","author":"D Toman","year":"2007","unstructured":"Toman, D., Weddell, G.: On order dependencies for the semantic web. In: Parent, C., Schewe, K.-D., Storey, V.C., Thalheim, B. (eds.) ER 2007. LNCS, vol. 4801, pp. 293\u2013306. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75563-0_21"},{"key":"19_CR34","unstructured":"Toman, D., Weddell, G.E.: Identifying objects over time with description logics. In: Brewka and Lang [9], pp. 724\u2013732. http:\/\/www.aaai.org\/Library\/KR\/2008\/kr08-071.php"},{"issue":"2\u20133","key":"19_CR35","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. Autom. Reasoning 40(2\u20133), 117\u2013132 (2008). https:\/\/doi.org\/10.1007\/s10817-007-9092-z","journal-title":"J. Autom. Reasoning"},{"key":"19_CR36","unstructured":"Toman, D., Weddell, G.E.: Applications and extensions of PTIME description logics with functional constraints. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, Pasadena, California, USA, 11\u201317 July 2009, pp. 948\u2013954 (2009). http:\/\/ijcai.org\/Proceedings\/09\/Papers\/161.pdf"},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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 $${\\cal{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\u2013361. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03680-9_36"},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-319-13560-1_47","volume-title":"PRICAI 2014: Trends in Artificial Intelligence","author":"D Toman","year":"2014","unstructured":"Toman, D., Weddell, G.: On adding inverse features to the description logic $$\\cal{CFD}^{\\forall }_{nc}$$ . In: Pham, D.-N., Park, S.-B. (eds.) PRICAI 2014. LNCS (LNAI), vol. 8862, pp. 587\u2013599. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13560-1_47"},{"key":"19_CR39","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-319-26350-2_50","volume-title":"AI 2015: Advances in Artificial Intelligence","author":"D Toman","year":"2015","unstructured":"Toman, D., Weddell, G.: On the krom extension of $$\\cal{CFDI}^{\\forall -}_{nc}$$ . In: Pfahringer, B., Renz, J. (eds.) AI 2015. LNCS (LNAI), vol. 9457, pp. 559\u2013571. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26350-2_50"},{"key":"19_CR40","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-319-42911-3_44","volume-title":"PRICAI 2016: Trends in Artificial Intelligence","author":"D Toman","year":"2016","unstructured":"Toman, D., Weddell, G.: On partial features in the $$\\cal{DLF}$$ Family of Description Logics. In: Booth, R., Zhang, M.-L. (eds.) PRICAI 2016. LNCS (LNAI), vol. 9810, pp. 529\u2013542. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42911-3_44"},{"key":"19_CR41","unstructured":"Toman, D., Weddell, G.E.: On partial features in the DLF dialects of description logic with inverse features. In: Artale, A., Glimm, B., Kontchakov, R. (eds.) Proceedings of the 30th International Workshop on Description Logics, Montpellier, France, 18\u201321 July 2017. CEUR Workshop Proceedings, vol. 1879. CEUR-WS.org (2017). http:\/\/ceur-ws.org\/Vol-1879\/paper44.pdf"}],"container-title":["Lecture Notes in Computer Science","Description Logic, Theory Combination, and All That"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22102-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T16:27:30Z","timestamp":1663777650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-22102-7_19"}},"subtitle":["A Family of Feature-Based Description Logics, with Applications in Querying Structured Data Sources"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030221010","9783030221027"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22102-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}