{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:14Z","timestamp":1750306694613,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"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":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603137","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["MSO queries on trees"],"prefix":"10.1145","author":[{"given":"Katja","family":"Losemann","sequence":"first","affiliation":[{"name":"University of Bayreuth"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[{"name":"University of Bayreuth"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_11"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1042046.1042050"},{"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\/1862919.1862926"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989317"},{"key":"e_1_3_2_1_6_1","first-page":"901","volume-title":"Languages and Programming (ICALP)","author":"Colcombet T.","year":"2007","unstructured":"T. Colcombet . A combinatorial theorem for trees. In International Colloquium on Automata , Languages and Programming (ICALP) , pages 901 -- 912 , 2007 . T. Colcombet. A combinatorial theorem for trees. In International Colloquium on Automata, Languages and Programming (ICALP), pages 901--912, 2007."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.08.021"},{"key":"e_1_3_2_1_8_1","first-page":"189","volume-title":"Computer Science Logic (CSL)","author":"Durand A.","year":"2011","unstructured":"A. Durand and Y. Strozecki . Enumeration complexity of logical query problems with second-order variables . In Computer Science Logic (CSL) , pages 189 -- 202 , 2011 . A. Durand and Y. Strozecki. Enumeration complexity of logical query problems with second-order variables. In Computer Science Logic (CSL), pages 189--202, 2011."},{"key":"e_1_3_2_1_9_1","author":"Frick M.","year":"2004","unstructured":"M. Frick and M. Grohe . The complexity of first-order and monadic second-order logic revisited. Annals of Pure and Applied Logic, 130(1--3):3--31 , 2004 . M. Frick and M. Grohe. The complexity of first-order and monadic second-order logic revisited. Annals of Pure and Applied Logic, 130(1--3):3--31, 2004.","journal-title":"Annals of Pure and Applied Logic, 130(1--3):3--31"},{"key":"e_1_3_2_1_10_1","volume-title":"Logic in Computer Science (LICS), page 188","author":"Frick M.","year":"2003","unstructured":"M. Frick , M. Grohe , and C. Koch . Query evaluation on compressed trees (extended abstract) . In Logic in Computer Science (LICS), page 188 , 2003 . M. Frick, M. Grohe, and C. Koch. Query evaluation on compressed trees (extended abstract). In Logic in Computer Science (LICS), page 188, 2003."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2463667"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528928"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11601524_14"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1520"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448498"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90047-L"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01691346"}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603137","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:41Z","timestamp":1750230101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603137"}},"subtitle":["enumerating answers under updates"],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":19,"alternative-id":["10.1145\/2603088.2603137","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603137","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}