{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T07:30:47Z","timestamp":1789716647423,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642315848","type":"print"},{"value":"9783642315855","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_11","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T07:56:29Z","timestamp":1340438189000},"page":"79-91","source":"Crossref","is-referenced-by-count":14,"title":["Monadic Datalog Containment"],"prefix":"10.1007","author":[{"given":"Michael","family":"Benedikt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Bourhis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Senellart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Shmueli, O.: Equivalence of datalog queries is undecidable. J. Log. Prog.\u00a015(3) (1993)","DOI":"10.1016\/0743-1066(93)90040-N"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bonatti, P.A.: On the decidability of containment of recursive datalog queries. In: PODS (2004)","DOI":"10.1145\/1055558.1055600"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Calvanese, D., De Giacomo, G., Vardi, M.Y.: Decidable containment of recursive queries. Theoretical Computer Science 336(1) (2005)","DOI":"10.1016\/j.tcs.2004.10.031"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Vardi, M.Y.: On the equivalence of recursive and nonrecursive Datalog programs. In: PODS (1992)","DOI":"10.1145\/137097.137109"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Vardi, M.Y.: On the equivalence of recursive and nonrecursive Datalog programs. JCSS 54(1) (1997)","DOI":"10.1006\/jcss.1997.1452"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs. In: STOC (1988)","DOI":"10.1145\/62212.62259"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Vardi, M.Y.: On the complexity of equivalence between recursive and nonrecursive Datalog programs. In: PODS (1994)","DOI":"10.1145\/182591.182604"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-87877-3_24","volume-title":"Conceptual Modeling - ER 2008","author":"A. Cal\u00ec","year":"2008","unstructured":"Cal\u00ec, A., Martinenghi, D.: Conjunctive Query Containment under Access Limitations. In: Li, Q., Spaccapietra, S., Yu, E., Oliv\u00e9, A. (eds.) ER 2008. LNCS, vol.\u00a05231, pp. 326\u2013340. Springer, Heidelberg (2008)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Gottlob, G., Senellart, P.: Determining relevance of accesses at runtime. In: PODS (2011)","DOI":"10.1145\/1989284.1989309"},{"key":"11_CR10","unstructured":"Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: KR (2000)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Recursive queries and context-free graph grammars. Theoretical Computer Science 78(1) (1991)","DOI":"10.1016\/0304-3975(51)90009-6"},{"key":"11_CR12","unstructured":"ten Cate, B., Segoufin, L.: Unary negation. In: STACS (2011)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Bourhis, P., Ley, C.: Querying schemas with access paths. PVLDB (2012)","DOI":"10.14778\/2180912.2180916"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-85238-4_10","volume-title":"Mathematical Foundations of Computer Science 2008","author":"H. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, H., Martens, W., Schwentick, T.: Optimizing Conjunctive Queries over Trees Using Schema Information. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 132\u2013143. Springer, Heidelberg (2008)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Rajaraman, A., Sagiv, Y., Ullman, J.D.: Answering queries using templates with binding patterns. In: PODS (1995)","DOI":"10.1145\/212433.220199"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Li, C., Chang, E.Y.: Answering queries with useful bindings. ACM TODS 26(3) (2001)","DOI":"10.1145\/502030.502032"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Cal\u00ec, A., Martinenghi, D.: Querying the deep web. In: EDBT (2010)","DOI":"10.1145\/1739041.1739138"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, H., Martens, W., Schwentick, T.: Validity of tree pattern queries with respect to schema information (2012) (unpublished draft)","DOI":"10.1007\/978-3-642-40313-2_17"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:13:24Z","timestamp":1620116004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}