{"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":1750307269302,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"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\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["G049165"],"award-info":[{"award-number":["G049165"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7-ICT-233599"],"award-info":[{"award-number":["FP7-ICT-233599"]}],"id":[{"id":"10.13039\/501100004963","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.1938558","type":"proceedings-article","created":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T13:21:09Z","timestamp":1297171269000},"page":"18-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient reasoning about data trees via integer linear programming"],"prefix":"10.1145","author":[{"given":"Claire","family":"David","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Est"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Libkin","sequence":"additional","affiliation":[{"name":"University of Edinburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tony","family":"Tan","sequence":"additional","affiliation":[{"name":"University of Edinburgh"}],"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.1016\/S0022-0000(03)00032-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/050646895"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346332"},{"key":"e_1_3_2_1_4_1","first-page":"862","volume-title":"ICALP'07","author":"Bj\u00f6rklund H.","unstructured":"H. Bj\u00f6rklund , M. Bojanczyk . Bounded depth data trees . In ICALP'07 , pages 862 -- 874 . H. Bj\u00f6rklund, M. Bojanczyk. Bounded depth data trees. In ICALP'07, pages 862--874."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85238-4_10"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516515"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.51"},{"key":"e_1_3_2_1_8_1","first-page":"248","volume-title":"CONCUR'01","author":"Bouyer P.","unstructured":"P. Bouyer , A. Petit , D. Th\u00e9rien . An algebraic characterization of data and timed languages . CONCUR'01 , pages 248 -- 261 . P. Bouyer, A. Petit, D. Th\u00e9rien. An algebraic characterization of data and timed languages. CONCUR'01, pages 248--261."},{"key":"e_1_3_2_1_9_1","volume-title":"LID'08","author":"Calvanese D.","year":"2008","unstructured":"D. Calvanese , G. De Giacomo , M. Lenzerini , and M. Y. Vardi . Regular XPath: constraints, query containment and view-based answering for XML documents . In LID'08 , 2008 . D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. Regular XPath: constraints, query containment and view-based answering for XML documents. In LID'08, 2008."},{"key":"e_1_3_2_1_10_1","volume-title":"et al. Tree Automata: Techniques and Applications","author":"Comon H.","year":"2007","unstructured":"H. Comon , et al. Tree Automata: Techniques and Applications . October 2007 . H. Comon, et al. Tree Automata: Techniques and Applications. October 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964013"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507244.1507246"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/567112.567117"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559827"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2973"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.11"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1805839.1805860"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.21"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2009.09.005"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536616.1536637"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1324185.1324188"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00030-2"},{"key":"e_1_3_2_1_23_1","first-page":"2","volume-title":"XML. In CSL","author":"Neven F.","year":"2002","unstructured":"F. Neven . Automata, logic, and XML. In CSL 2002 , pages 2 -- 26 . F. Neven. Automata, logic, and XML. In CSL 2002, pages 2--26."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00301-2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645730.668039"},{"key":"e_1_3_2_1_26_1","first-page":"549","volume-title":"CP'97","author":"Pacholski L.","unstructured":"L. Pacholski , A. Podelski . Set constraints: a pearl in research on constraints . In CP'97 , pages 549 -- 562 . L. Pacholski, A. Podelski. Set constraints: a pearl in research on constraints. In CP'97, pages 549--562."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322287"},{"key":"e_1_3_2_1_28_1","volume-title":"Handbook of Automated Reasoning","author":"Robinson A.","year":"2001","unstructured":"A. Robinson , A. Voronkov , eds. Handbook of Automated Reasoning . The MIT Press , 2001 . A. Robinson, A. Voronkov, eds. Handbook of Automated Reasoning. The MIT Press, 2001."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974140"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773169"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_94"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(67)80022-9"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11532231_25"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375554"},{"key":"e_1_3_2_1_35_1","volume-title":"Introduction to Graph Theory","author":"West D.","year":"2001","unstructured":"D. West . Introduction to Graph Theory . Prentice Hall , 2001 . D. West. Introduction to Graph Theory. Prentice Hall, 2001."}],"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.1938558","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1938551.1938558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:54Z","timestamp":1750243974000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1938551.1938558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":35,"alternative-id":["10.1145\/1938551.1938558","10.1145\/1938551"],"URL":"https:\/\/doi.org\/10.1145\/1938551.1938558","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"}}]}}