{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:40:28Z","timestamp":1770972028065,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,22]]},"DOI":"10.1145\/2463664.2465227","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"151-162","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Flag & check"],"prefix":"10.1145","author":[{"given":"Sebastian","family":"Rudolph","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Dresden, Germany"}]},{"given":"Markus","family":"Kr\u00f6tzsch","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004275029985"},{"key":"e_1_3_2_1_3_1","first-page":"407","volume-title":"D. Dubois, C. A. Welty, and M.-A","author":"Baget J.-F.","year":"2004","unstructured":"J.-F. Baget . Improving the forward chaining algorithm for conceptual graphs rules . In D. Dubois, C. A. Welty, and M.-A . Williams, editors, KR, pages 407 -- 414 . AAAI Press , 2004 . J.-F. Baget. Improving the forward chaining algorithm for conceptual graphs rules. In D. Dubois, C. A. Welty, and M.-A. Williams, editors, KR, pages 407--414. AAAI Press, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.002"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-126"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646235.682563"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_11"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR'08)","author":"Brewka G.","year":"2008","unstructured":"G. Brewka and J. Lang , editors . Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR'08) . AAAI Press , 2008 . G. Brewka and J. Lang, editors. Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR'08). AAAI Press, 2008."},{"key":"e_1_3_2_1_9_1","first-page":"70","volume-title":"Brewka and Lang {8}","author":"Cal\u00ec A.","unstructured":"A. Cal\u00ec , G. Gottlob , and M. Kifer . Taming the infinite chase: Query answering under expressive relational constraints . In Brewka and Lang {8} , pages 70 -- 80 . A. Cal\u00ec, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Brewka and Lang {8}, pages 70--80."},{"key":"e_1_3_2_1_10_1","first-page":"77","volume-title":"Paredaens and Su {41}","author":"Cal\u00ec A.","unstructured":"A. Cal\u00ec , G. Gottlob , and T. Lukasiewicz . A general datalog-based framework for tractable query answering over ontologies . In Paredaens and Su {41} pages 77 -- 86 . A. Cal\u00ec, G. Gottlob, and T. Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. In Paredaens and Su {41} pages 77--86."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920912"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1894568.1894570"},{"key":"e_1_3_2_1_13_1","unstructured":"D. Calvanese. Personal communication September 2011.  D. Calvanese. Personal communication September 2011."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9078-x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/959060.959076"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802488"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32925-8_8"},{"issue":"4","key":"e_1_3_2_1_19_1","first-page":"187","article-title":"The monadic second-order logic of graphs, ii: Infinite graphs of bounded width","volume":"21","author":"Courcelle B.","unstructured":"B. Courcelle . The monadic second-order logic of graphs, ii: Infinite graphs of bounded width . Mathematical Systems Theory , 21 ( 4 ): 187 -- 221 , 19 B. Courcelle. The monadic second-order logic of graphs, ii: Infinite graphs of bounded width. Mathematical Systems Theory, 21(4):187--221, 19","journal-title":"Mathematical Systems Theory"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(51)90009-6"},{"key":"e_1_3_2_1_21_1","volume-title":"August","author":"Courcelle B.","year":"2011","unstructured":"B. Courcelle . Personal communication , August 2011 . B. Courcelle. Personal communication, August 2011."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2414243"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376938"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645505.656436"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.033"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275503"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/962446.962450"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00012-9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920858"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216051"},{"key":"e_1_3_2_1_32_1","first-page":"274","volume-title":"Brewka and Lang {8}","author":"Kazakov Y.","unstructured":"Y. Kazakov . RIQ and SROIQ are harder than SHOIQ. In Brewka and Lang {8} , pages 274 -- 284 . Y. Kazakov. RIQ and SROIQ are harder than SHOIQ. In Brewka and Lang {8}, pages 274--284."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14203-1_40"},{"key":"e_1_3_2_1_34_1","first-page":"963","volume-title":"Walsh {47}","author":"Kr\u00f6tzsch M.","unstructured":"M. Kr\u00f6tzsch and S. Rudolph . Extending decidable existential rules by joining acyclicity and guardedness . In Walsh {47} , pages 963 -- 968 . M. Kr\u00f6tzsch and S. Rudolph. Extending decidable existential rules by joining acyclicity and guardedness. In Walsh {47}, pages 963--968."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1785162.1785186"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1024196"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559799"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687737"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/2036949.2036951"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-178"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1559795"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(93)90040-N"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"L. J. Stockmeyer. The polynomial-time hierarchy. Theor. Comput. Sci.} 3(1):1--22 1976.  L. J. Stockmeyer. The polynomial-time hierarchy. Theor. Comput. Sci.} 3(1):1--22 1976.","DOI":"10.1016\/0304-3975(76)90061-X"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283396"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","location":"New York New York USA","acronym":"SIGMOD\/PODS'13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463664.2465227","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463664.2465227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:01Z","timestamp":1750235941000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463664.2465227"}},"subtitle":["data access with monadically defined queries"],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":45,"alternative-id":["10.1145\/2463664.2465227","10.1145\/2463664"],"URL":"https:\/\/doi.org\/10.1145\/2463664.2465227","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}