{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:41:32Z","timestamp":1725864092802},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319452753"},{"type":"electronic","value":"9783319452760"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45276-0_11","type":"book-chapter","created":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T08:18:04Z","timestamp":1472113084000},"page":"144-158","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid Approach to Query Answering Under Expressive Datalog $$^\\pm $$"],"prefix":"10.1007","author":[{"given":"Mostafa","family":"Milani","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Cal\u00ec","sequence":"additional","affiliation":[]},{"given":"Leopoldo","family":"Bertossi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,26]]},"reference":[{"key":"11_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-10843-2_7","volume-title":"Automata, Languages and Programming","author":"C Beeri","year":"1981","unstructured":"Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) Automata, Languages and Programming. LNCS, vol. 115, pp. 73\u201385. Springer, Heidelberg (1981)"},{"issue":"4","key":"11_CR3","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/1634.1636","volume":"31","author":"C Beeri","year":"1984","unstructured":"Beeri, C., Vardi, M.Y.: A procedure for data dependencies. J. ACM 31(4), 718\u2013741 (1984)","journal-title":"J. ACM"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.websem.2012.03.001","volume":"14","author":"A Cal\u00ec","year":"2012","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)","journal-title":"J. Web Semant."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.artint.2012.08.002","volume":"193","author":"A Cal\u00ec","year":"2012","unstructured":"Cal\u00ec, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: the query answering problem. Artif. Intell. 193, 87\u2013128 (2012)","journal-title":"Artif. Intell."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Nash, A., Remmel, J.B.: The chase revisited. In: Proceedings of PODS, pp. 149\u2013158 (2008)","DOI":"10.1145\/1376916.1376938"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.tcs.2004.10.033","volume":"336","author":"R Fagin","year":"2005","unstructured":"Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. TCS 336, 89\u2013124 (2005)","journal-title":"TCS"},{"issue":"3","key":"11_CR8","first-page":"25","volume":"39","author":"G Gottlob","year":"2014","unstructured":"Gottlob, G., Orsi, G., Pieris, A.: Query rewriting and optimization for ontological databases. Proc. TODS 39(3), 25 (2014)","journal-title":"Proc. TODS"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Klug, A.: Testing containment of conjunctive queries under functional and inclusion dependencies. In: Proceedings of PODS, pp. 164\u2013169 (1984)","DOI":"10.1016\/0022-0000(84)90081-3"},{"key":"11_CR10","unstructured":"Kr\u00f6tzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Proceedings of IJCAI, pp. 963\u2013968 (2011)"},{"key":"11_CR11","unstructured":"Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable datalog $$^\\pm $$ programs. In: Proceedings of KR, pp. 13\u201323 (2012)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Maier, D., Mendelzon, A., Sagiv, Y.: Testing implications of data dependencies. In: Proceedings of TODS, p. 152 (1979)","DOI":"10.1145\/582095.582119"},{"key":"11_CR13","unstructured":"Milani, M., Bertossi, L.: Tractable query answering and optimization for extensions of weakly-sticky datalog+-. In: Proceedings of AMW (2015)"},{"key":"11_CR14","unstructured":"Milani, M., Cal\u00ec, A., Bertossi, L.: A Hybrid Approach to Query Answering under Expressive Datalog $$^\\pm $$ . Technical report. https:\/\/goo.gl\/edg9FK"}],"container-title":["Lecture Notes in Computer Science","Web Reasoning and Rule Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45276-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:21:10Z","timestamp":1498339270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45276-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319452753","9783319452760"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45276-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}