{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:39Z","timestamp":1742912859566,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15579-1_13","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"175-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Logics for Unordered Trees with Data Constraints on Siblings"],"prefix":"10.1007","author":[{"given":"Adrien","family":"Boiret","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Hugot","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Treinen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Bourhis, P., Muscholl, A., Wu, Z.: Recursive queries on trees and data trees. In: ICDT, pp. 93\u2013104. ACM (2013)","DOI":"10.1145\/2448496.2448509"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Benzaken, V., Castagna, G., Nguyen, K., Sim\u00e9on, J.: Static and dynamic semantics of NoSQL languages. In: POPL, pp. 101\u2013114. ACM (2013)","DOI":"10.1145\/2480359.2429083"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Boiret, A., Hugot, V., Niehren, J., Treinen, R.: Deterministic Automata for Unordered Trees. In: Fifth International Symposium on Games, Automata, Logics and Formal Verification (Gandalf) (2014)","DOI":"10.4204\/EPTCS.161.17"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1970398.1970403","volume":"12","author":"M Bojanczyk","year":"2011","unstructured":"Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4), 27 (2011)","journal-title":"ACM Trans. Comput. Log."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-32033-3_36","volume-title":"Term Rewriting and Applications","author":"I Boneva","year":"2005","unstructured":"Boneva, I., Talbot, J.-M.: Automata and Logics for Unranked and Unordered Trees. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 500\u2013515. Springer, Heidelberg (2005)"},{"issue":"1\u20136","key":"13_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Mathematical Logic Quarterly 6(1\u20136), 66\u201392 (1960)","journal-title":"Mathematical Logic Quarterly"},{"key":"13_CR7","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007). http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Information and computation 85(1), 12\u201375 (1990)","journal-title":"Information and computation"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Figueira, D.: On XPath with transitive axes and data tests. In: ACM Symposium on Principles of Database, System, pp. 249\u2013260 (2013)","DOI":"10.1145\/2463664.2463675"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.2307\/2273878","volume":"52","author":"H L\u00e4uchli","year":"1987","unstructured":"L\u00e4uchli, H., Savioz, C.: Monadic second order definable relations on the binary tree. Journal of Symbol Logic 52(1), 219\u2013226 (1987)","journal-title":"Journal of Symbol Logic"},{"key":"13_CR11","unstructured":"M\u00fcller, M., Niehren, J., Treinen, R.: The first-order theory of ordering constraints over feature trees. In: 13th annual IEEE Symposium on Logic in Computer Sience, pp. 432\u2013443 (1998)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-56610-4_76","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"J Niehren","year":"1993","unstructured":"Niehren, J., Podelski, A.: Feature automata and recognizable sets of feature trees. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol. 668, pp. 356\u2013375. Springer, Heidelberg (1993)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Rabin, M.: Automata on Infinite Objects and Church\u2019s Problem. Number 13 in Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics. AMS (1972)","DOI":"10.1090\/cbms\/013"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: ACM Symposium on Principles of Database Systems, pp. 155\u2013166 (2003)","DOI":"10.1145\/773153.773169"},{"key":"13_CR15","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Counting in trees. In: Logic and Automata. Texts in Logic and Games, vol. 2, pp. 575\u2013612. Amsterdam University Press (2008)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0743-1066(92)90039-6","volume":"12","author":"G Smolka","year":"1992","unstructured":"Smolka, G.: Feature constraint logics for unification grammars. Journal of Logic Programming 12, 51\u201387 (1992)","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"13_CR17","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0743-1066(94)90044-2","volume":"18","author":"G Smolka","year":"1994","unstructured":"Smolka, G., Treinen, R.: Records for logic programming. J. Log. Program. 18(3), 229\u2013258 (1994)","journal-title":"J. Log. Program."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L., Meyer, A.: Word problems requiring exponential time. In: Symposium on the Theory of Computing. Association for Computing Machinery, Association for Computing Machinery, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"JW Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical systems theory 2(1), 57\u201381 (1968)","journal-title":"Mathematical systems theory"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"JW Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata with an application to the decision problem of second-order logic. Mathematical System Theory 2, 57\u201382 (1968)","journal-title":"Mathematical System Theory"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-44881-0_18","volume-title":"Rewriting Techniques and Applications","author":"SD Zilio","year":"2003","unstructured":"Zilio, S.D., Lugiez, D.: XML Schema, Tree Logic and Sheaves Automata. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 246\u2013263. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T22:37:19Z","timestamp":1676932639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}