{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:40:37Z","timestamp":1743057637254,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031802829"},{"type":"electronic","value":"9783031802836"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-80283-6_1","type":"book-chapter","created":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T06:45:44Z","timestamp":1738392344000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compact Query Rewritings for\u00a0Ontology-Based Query Answering"],"prefix":"10.1007","author":[{"given":"Micha\u00ebl","family":"Thomazo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,2]]},"reference":[{"key":"1_CR1","unstructured":"Acciarri, A., et al.: Quonto: querying ontologies. In: Veloso, M.M., Kambhampati, S. (eds.) Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9\u201313, 2005, Pittsburgh, Pennsylvania, USA, pp. 1670\u20131671. AAAI Press\/The MIT Press (2005). http:\/\/www.aaai.org\/Library\/AAAI\/2005\/isd05-001.php"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Ahmetaj, S., Ortiz, M., Simkus, M.: Rewriting guarded existential rules into small datalog programs. In: Kimelfeld, B., Amsterdamer, Y. (eds.) 21st International Conference on Database Theory, ICDT 2018, March 26\u201329, 2018, Vienna, Austria. LIPIcs, vol.\u00a098, pp. 4:1\u20134:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPICS.ICDT.2018.4","DOI":"10.4230\/LIPICS.ICDT.2018.4"},{"key":"1_CR3","unstructured":"Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Gottlob, G., Walsh, T. (eds.) IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9\u201315, 2003, pp. 325\u2013330. Morgan Kaufmann (2003). http:\/\/ijcai.org\/Proceedings\/03\/Papers\/048.pdf"},{"key":"1_CR4","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press (2003)"},{"issue":"9\u201310","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.artint.2011.03.002","volume":"175","author":"J Baget","year":"2011","unstructured":"Baget, J., Lecl\u00e8re, M., Mugnier, M., Salvat, E.: On rules with existential variables: walking the decidability line. Artif. Intell. 175(9\u201310), 1620\u20131654 (2011). https:\/\/doi.org\/10.1016\/j.artint.2011.03.002","journal-title":"Artif. Intell."},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"B\u00e1r\u00e1ny, V., Benedikt, M., ten Cate, B.: Rewriting guarded negation queries. In: Chatterjee, K., Sgall, J. (eds.) Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26\u201330, 2013. Proceedings. Lecture Notes in Computer Science, vol.\u00a08087, pp. 98\u2013110. Springer (2013https:\/\/doi.org\/10.1007\/978-3-642-40313-2_11","DOI":"10.1007\/978-3-642-40313-2_11"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13\u201317, 1981, Proceedings. Lecture Notes in Computer Science, vol.\u00a0115, pp. 73\u201385. Springer (1981https:\/\/doi.org\/10.1007\/3-540-10843-2_7","DOI":"10.1007\/3-540-10843-2_7"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1145\/1634.1636","volume":"31","author":"C Beeri","year":"1984","unstructured":"Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. J. ACM 31(4), 718\u2013741 (1984). https:\/\/doi.org\/10.1145\/1634.1636","journal-title":"J. ACM"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Berger, G., Gottlob, G., Pieris, A., Sallinger, E.: The space-efficient core of vadalog. ACM Trans. Database Syst. 47(1), 1:1\u20131:46 (2022). https:\/\/doi.org\/10.1145\/3488720","DOI":"10.1145\/3488720"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Bienvenu, M., Kikot, S., Kontchakov, R., Podolskii, V.V., Zakharyaschev, M.: Ontology-mediated queries: combined complexity and succinctness of rewritings via circuit complexity. J. ACM 65(5), 28:1\u201328:51 (2018). https:\/\/doi.org\/10.1145\/3191832","DOI":"10.1145\/3191832"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Bursztyn, D., Goasdou\u00e9, F., Manolescu, I.: Teaching an RDBMS about ontological constraints. Proc. VLDB Endow. 9(12), 1161\u20131172 (2016). https:\/\/doi.org\/10.14778\/2994509.2994532, http:\/\/www.vldb.org\/pvldb\/vol9\/p1161-bursztyn.pdf","DOI":"10.14778\/2994509.2994532"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Cal\u00ec, A., Gottlob, G., Kifer, M.: Taming the infinite chase: query answering under expressive relational constraints. J. Artif. Intell. Res. 48, 115\u2013174 (2013). https:\/\/doi.org\/10.1613\/jair.3873","DOI":"10.1613\/jair.3873"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Semant. 14, 57\u201383 (2012). https:\/\/doi.org\/10.1016\/J.WEBSEM.2012.03.001","DOI":"10.1016\/J.WEBSEM.2012.03.001"},{"key":"1_CR14","unstructured":"Cal\u00ec, A., Gottlob, G., Pieris, A.: Query rewriting under non-guarded rules. In: Laender, A.H.F., Lakshmanan, L.V.S. (eds.) Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, Buenos Aires, Argentina, May 17\u201320, 2010. CEUR Workshop Proceedings, vol.\u00a0619. CEUR-WS.org (2010). https:\/\/ceur-ws.org\/Vol-619\/paper12.pdf"},{"issue":"3","key":"1_CR15","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. Reason. 39(3), 385\u2013429 (2007). https:\/\/doi.org\/10.1007\/s10817-007-9078-x","journal-title":"J. Autom. Reason."},{"key":"1_CR16","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: Cohn, A.G., Giunchiglia, F., Selman, B. (eds.) KR 2000, Principles of Knowledge Representation and Reasoning Proceedings of the Seventh International Conference, Breckenridge, Colorado, USA, April 11\u201315, 2000, pp. 176\u2013185. Morgan Kaufmann (2000)"},{"key":"1_CR17","unstructured":"Carral, D., Dragoste, I., Kr\u00f6tzsch, M.: The combined approach to query answering in horn-alchoiq. In: Thielscher, M., Toni, F., Wolter, F. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October\u20132 November 2018, pp. 339\u2013348. AAAI Press (2018). https:\/\/aaai.org\/ocs\/index.php\/KR\/KR18\/paper\/view\/18076"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Carral, D., Gonz\u00e1lez, L., Koopmann, P.: From horn-sriq to datalog: a data-independent transformation that preserves assertion entailment. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27\u2013February 1, 2019, pp. 2736\u20132743. AAAI Press (2019). https:\/\/doi.org\/10.1609\/AAAI.V33I01.33012736","DOI":"10.1609\/AAAI.V33I01.33012736"},{"key":"1_CR19","unstructured":"Carral, D., Larroque, L., Mugnier, M., Thomazo, M.: Normalisations of existential rules: not so innocuous! In: Kern-Isberner, G., Lakemeyer, G., Meyer, T. (eds.) Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022, Haifa, Israel, July 31\u2013August 5, 2022 (2022). https:\/\/proceedings.kr.org\/2022\/11\/"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Gottlob, G., Kikot, S., Kontchakov, R., Podolskii, V.V., Schwentick, T., Zakharyaschev, M.: The price of query rewriting in ontology-based data access. Artif. Intell. 213, 42\u201359 (2014). https:\/\/doi.org\/10.1016\/j.artint.2014.04.004","DOI":"10.1016\/j.artint.2014.04.004"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Gottlob, G., Orsi, G., Pieris, A.: Query rewriting and optimization for ontological databases. ACM Trans. Database Syst. 39(3), 25:1\u201325:46 (2014). https:\/\/doi.org\/10.1145\/2638546","DOI":"10.1145\/2638546"},{"key":"1_CR22","unstructured":"Gottlob, G., Schwentick, T.: Rewriting ontological queries into small nonrecursive datalog programs. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10\u201314, 2012. AAAI Press (2012). http:\/\/www.aaai.org\/ocs\/index.php\/KR\/KR12\/paper\/view\/4510"},{"issue":"3","key":"1_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.3233\/FI-2018-1627","volume":"157","author":"G Grahne","year":"2018","unstructured":"Grahne, G., Onet, A.: Anatomy of the chase. Fundam. Informaticae 157(3), 221\u2013270 (2018). https:\/\/doi.org\/10.3233\/FI-2018-1627","journal-title":"Fundam. Informaticae"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Imprialou, M., Stoilos, G., Grau, B.C.: Benchmarking ontology-based query rewriting systems. In: Hoffmann, J., Selman, B. (eds.) Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22\u201326, 2012, Toronto, Ontario, Canada, pp. 779\u2013785. AAAI Press (2012). https:\/\/doi.org\/10.1609\/AAAI.V26I1.8215","DOI":"10.1609\/AAAI.V26I1.8215"},{"issue":"5","key":"1_CR25","doi-asserted-by":"publisher","first-page":"451","DOI":"10.3233\/SW-140153","volume":"6","author":"M K\u00f6nig","year":"2015","unstructured":"K\u00f6nig, M., Lecl\u00e8re, M., Mugnier, M., Thomazo, M.: Sound, complete and minimal UCQ-rewriting for existential rules. Semantic Web 6(5), 451\u2013475 (2015). https:\/\/doi.org\/10.3233\/SW-140153","journal-title":"Semantic Web"},{"key":"1_CR26","unstructured":"Lecl\u00e8re, M., Mugnier, M., Ulliana, F.: On bounded positive existential rules. In: Lenzerini, M., Pe\u00f1aloza, R. (eds.) Proceedings of the 29th International Workshop on Description Logics, Cape Town, South Africa, April 22\u201325, 2016. CEUR Workshop Proceedings, vol.\u00a01577. CEUR-WS.org (2016). https:\/\/ceur-ws.org\/Vol-1577\/paper_31.pdf"},{"key":"1_CR27","unstructured":"Marnette, B.: Resolution and datalog rewriting under value invention and equality constraints. CoRR arXiv:1212.0254 (2012)"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"P\u00e9rez-Urbina, H., Horrocks, I., Motik, B.: Efficient query answering for OWL 2. In: Bernstein, A., et al. (eds.) The Semantic Web - ISWC 2009, 8th International Semantic Web Conference, ISWC 2009, Chantilly, VA, USA, October 25\u201329, 2009. Proceedings. Lecture Notes in Computer Science, vol.\u00a05823, pp. 489\u2013504. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-04930-9_31","DOI":"10.1007\/978-3-642-04930-9_31"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Rossman, B.: Homomorphism preservation theorems. J. ACM 55(3), 15:1\u201315:53 (2008). https:\/\/doi.org\/10.1145\/1379759.1379763","DOI":"10.1145\/1379759.1379763"},{"issue":"3","key":"1_CR30","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0743-1066(93)90040-N","volume":"15","author":"O Shmueli","year":"1993","unstructured":"Shmueli, O.: Equivalence of DATALOG queries is undecidable. J. Log. Program. 15(3), 231\u2013241 (1993). https:\/\/doi.org\/10.1016\/0743-1066(93)90040-N","journal-title":"J. Log. Program."},{"key":"1_CR31","unstructured":"Thomazo, M.: Conjunctive query answering under existential rules - decidability, complexity, and algorithms. Ph. D. thesis, Montpellier 2 University, France (2013). https:\/\/tel.archives-ouvertes.fr\/tel-00925722"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/S10115-019-01345-2","volume":"62","author":"D Trivela","year":"2020","unstructured":"Trivela, D., Stoilos, G., Chortaras, A., Stamou, G.: Resolution-based rewriting for horn-SHIQ ontologies. Knowl. Inf. Syst. 62(1), 107\u2013143 (2020). https:\/\/doi.org\/10.1007\/S10115-019-01345-2","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"1_CR33","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/2206869.2206879","volume":"41","author":"PT Wood","year":"2012","unstructured":"Wood, P.T.: Query languages for graph databases. SIGMOD Rec. 41(1), 50\u201360 (2012). https:\/\/doi.org\/10.1145\/2206869.2206879","journal-title":"SIGMOD Rec."}],"container-title":["Lecture Notes in Computer Science","Reasoning Web. Declarative Artificial Intelligence: Knowledge, Rules, Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-80283-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T06:45:53Z","timestamp":1738392353000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-80283-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031802829","9783031802836"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-80283-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"2 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}