{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:23Z","timestamp":1750308623438,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T00:00:00Z","timestamp":1332720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"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"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["MA 4938\/2-1"],"award-info":[{"award-number":["MA 4938\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,3,26]]},"DOI":"10.1145\/2274576.2274584","type":"proceedings-article","created":{"date-parts":[[2012,6,15]],"date-time":"2012-06-15T15:32:03Z","timestamp":1339774323000},"page":"61-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Deciding twig-definability of node selecting tree automata"],"prefix":"10.1145","author":[{"given":"Timos","family":"Antonopoulos","sequence":"first","affiliation":[{"name":"Hasselt University and Transnational University of Limburg"}]},{"given":"Dag","family":"Hovland","sequence":"additional","affiliation":[{"name":"University of Oslo"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bayreuth"}]},{"given":"Frank","family":"Neven","sequence":"additional","affiliation":[{"name":"Hasselt University and Transnational University of Limburg"}]}],"member":"320","published-online":{"date-parts":[[2012,3,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346333"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.030"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1456650.1456653"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1614431.1614435"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88282-4_1"},{"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.1145\/1989727.1989731"},{"key":"e_1_3_2_1_8_1","volume-title":"Tree languages defined in first-order logic with one quantifier alternation. Logical Methods in Computer Science, 6(4)","author":"Boja\u0144czyk M.","year":"2010","unstructured":"M. Boja\u0144czyk and L. Segoufin . Tree languages defined in first-order logic with one quantifier alternation. Logical Methods in Computer Science, 6(4) , 2010 . M. Boja\u0144czyk and L. Segoufin. Tree languages defined in first-order logic with one quantifier alternation. Logical Methods in Computer Science, 6(4), 2010."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.01.018"},{"key":"e_1_3_2_1_10_1","volume-title":"AAAI Conference on Artificial Intelligence (AAAI)","author":"Calvanese D.","year":"2010","unstructured":"D. Calvanese , G. D. Giacomo , M. Lenzerini , and M. Y. Vardi . Node selection query languages for trees . In AAAI Conference on Artificial Intelligence (AAAI) , 2010 . D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi. Node selection query languages for trees. In AAAI Conference on Artificial Intelligence (AAAI), 2010."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25979-4_8"},{"key":"e_1_3_2_1_12_1","volume-title":"Tree Automata Techniques and Applications. Available on http:\/\/tata.gforge.inria.fr\/","author":"Comon H.","year":"2007","unstructured":"H. Comon , M. Dauchet , R. Gilleron , F. Jacquemard , D. Lugiez , C. L\u00f6ding , S. Tison , and M. Tommasi . Tree Automata Techniques and Applications. Available on http:\/\/tata.gforge.inria.fr\/ , 2007 . H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, C. L\u00f6ding, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on http:\/\/tata.gforge.inria.fr\/, 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1564"},{"key":"e_1_3_2_1_14_1","first-page":"188","volume-title":"IEEE Symposium on Logic in Computer Science (LICS)","author":"Frick M.","unstructured":"M. Frick , M. Grohe , and C. Koch . Query evaluation on compressed trees (extended abstract) . In IEEE Symposium on Logic in Computer Science (LICS) , pages 188 --, 2003. M. Frick, M. Grohe, and C. Koch. Query evaluation on compressed trees (extended abstract). In IEEE Symposium on Logic in Computer Science (LICS), pages 188--, 2003."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807118"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.24"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/962446.962450"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071614"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1059513.1059520"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166076"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114244.1114247"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/962446.962448"},{"key":"e_1_3_2_1_23_1","volume-title":"Limburgs Universitair Centrum","author":"Neven F.","year":"1999","unstructured":"F. Neven . Design and Analysis of Query Languages for Structured Documents. PhD thesis , Limburgs Universitair Centrum , 1999 . F. Neven. Design and Analysis of Query Languages for Structured Documents. PhD thesis, Limburgs Universitair Centrum, 1999."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/601858.601869"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.008"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/505241.505245"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335217"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00301-2"},{"key":"e_1_3_2_1_29_1","volume-title":"On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2(3)","author":"Neven F.","year":"2006","unstructured":"F. Neven and T. Schwentick . On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2(3) , 2006 . F. Neven and T. Schwentick. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2(3), 2006."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.17"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974140"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219027"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568321"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706591.1706598"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/267871.267878"}],"event":{"name":"ICDT '12: 15th International Conference on Database Theory","acronym":"ICDT '12","location":"Berlin Germany"},"container-title":["Proceedings of the 15th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2274576.2274584","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2274576.2274584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:44Z","timestamp":1750273664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2274576.2274584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,26]]},"references-count":35,"alternative-id":["10.1145\/2274576.2274584","10.1145\/2274576"],"URL":"https:\/\/doi.org\/10.1145\/2274576.2274584","relation":{},"subject":[],"published":{"date-parts":[[2012,3,26]]},"assertion":[{"value":"2012-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}