{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:49Z","timestamp":1750307269217,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","award":["ICT08-032"],"award-info":[{"award-number":["ICT08-032"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P20704-N18"],"award-info":[{"award-number":["P20704-N18"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1938551.1938583","type":"proceedings-article","created":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T13:21:09Z","timestamp":1297171269000},"page":"244-255","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["The complexity of evaluating tuple generating dependencies"],"prefix":"10.1145","author":[{"given":"Reinhard","family":"Pichler","sequence":"first","affiliation":[{"name":"Vienna University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Skritek","sequence":"additional","affiliation":[{"name":"Vienna University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275516"},{"volume-title":"Addison-Wesley","year":"1995","author":"Abiteboul S.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376936"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055592"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1636"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247482"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00220-0"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"W. Conradie V. Goranko and D. Vakarelov. Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. Log. Methods in Comp. Sci. 2(1) 2006.  W. Conradie V. Goranko and D. Vakarelov. Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. Log. Methods in Comp. Sci. 2(1) 2006.","DOI":"10.2168\/LMCS-2(1:5)2006"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2464827"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/322344.322347"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1O16\/j.tcs.2004.10.033"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061323"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114244.1114249"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602222"},{"volume-title":"Texts in Theoretical Computer Science. Springer","year":"2006","author":"Flum J.","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","first-page":"67","volume-title":"Proc. VLDB'06","author":"Fuxman A.","year":"2006"},{"key":"e_1_3_2_1_17_1","unstructured":"D.\n       \n      Gabbay R.\n       \n      Schmidt and \n      \n      \n      A.\n       \n      Szalas\n      \n  \n  . \n  Second-Order Quantifier Elimination: Foundations Computational Aspects and Applications volume \n  12\n   of \n  Studies in Logic\n  . \n  College Publications 1995\n  .  D. Gabbay R. Schmidt and A. Szalas. Second-Order Quantifier Elimination: Foundations Computational Aspects and Applications volume 12 of Studies in Logic . College Publications 1995."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00030-8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346334"},{"key":"e_1_3_2_1_20_1","first-page":"675","volume-title":"Proc. VLDB'07","author":"Green T. J.","year":"2007"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380867"},{"volume-title":"Proc. ICDE'03, page 505","year":"2003","author":"Halevy A. Y.","key":"e_1_3_2_1_22_1"},{"key":"e_1_3_2_1_23_1","first-page":"9","volume-title":"Proc. VLDB'06","author":"Halevy A. Y.","year":"2006"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90081-3"},{"volume-title":"Springer","year":"1994","author":"Kloks T.","key":"e_1_3_2_1_25_1"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065176"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142357"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687650"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543644"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142360"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88737-9_8"},{"volume-title":"Oxford University Press","year":"2006","author":"Niedermeier R.","key":"e_1_3_2_1_32_1"},{"volume-title":"Addison Wesley","year":"1994","author":"Papadimitriou C. H.","key":"e_1_3_2_1_33_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287421"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2009.06.002"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514903"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"}],"event":{"name":"EDBT\/ICDT '11: EDBT\/ICDT '11 joint conference","acronym":"EDBT\/ICDT '11","location":"Uppsala Sweden"},"container-title":["Proceedings of the 14th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1938551.1938583","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1938551.1938583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:55Z","timestamp":1750243975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1938551.1938583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":37,"alternative-id":["10.1145\/1938551.1938583","10.1145\/1938551"],"URL":"https:\/\/doi.org\/10.1145\/1938551.1938583","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}