{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:27:08Z","timestamp":1750188428031,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.2002.1029829","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T18:14:31Z","timestamp":1056564871000},"page":"203-212","source":"Crossref","is-referenced-by-count":6,"title":["Tree extension algebras: logics, automata, and query languages"],"prefix":"10.1109","author":[{"given":"M.","family":"Benedikt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Libkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1515\/9783110806786"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375554"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511551574"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275515"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"15","first-page":"516","article-title":"MONA 1.x: New techniques for WS1S and WS2S","author":"elgaard","year":"0","journal-title":"CAV'98"},{"key":"34","first-page":"31","article-title":"Logical aspects in the study of tree languages","author":"thomas","year":"0","journal-title":"CAAP '84"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.2307\/2586806"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335218"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.3115\/981344.981377"},{"key":"11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.36045\/bbms\/1103408547","article-title":"Logic and p-recognizable sets of integers","volume":"1","author":"bruye?re","year":"1994","journal-title":"Bull Belg Math Soc"},{"journal-title":"Tree Automata Techniques and Applications","year":"0","author":"comon","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-45.2.377"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1996.561360"},{"key":"22","first-page":"477","article-title":"The inherent complexity of theories of ordered sets","author":"meyer","year":"1975","journal-title":"Proc Int Congress of Mathematics"},{"key":"23","first-page":"196","article-title":"Ordering constraints over feature trees expressed in second-order monadic logic","author":"mu?ller","year":"0","journal-title":"RTAS'98"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017447"},{"key":"25","first-page":"432","article-title":"The first-order theory of ordering constraints over feature trees","author":"mu?ller","year":"0","journal-title":"LICS'98"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028571"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017466"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57163-9_34"},{"key":"29","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/BFb0015252","article-title":"The Oz programming model","author":"smolka","year":"1995","journal-title":"Computer Science Today"},{"key":"3","first-page":"326","article-title":"Set constraints: Results, applications, and future directions","author":"aiken","year":"0","journal-title":"PPCP'94"},{"journal-title":"Foundations of Databases","year":"1995","author":"abiteboul","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2000.855755"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2001.932513"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90044-2"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798342484"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347477"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503292"},{"journal-title":"Computational Learning Theory","year":"1992","author":"anthony","key":"5"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2792"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744439"},{"key":"9","first-page":"431","article-title":"A model-theoretic approach to regular string relations","author":"benedikt","year":"0","journal-title":"LICS'01"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375578"}],"event":{"name":"17th Annual IEEE Symposium on Logic in Computer Science","acronym":"LICS-02","location":"Copenhagen, Denmark"},"container-title":["Proceedings 17th Annual IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8005\/22127\/01029829.pdf?arnumber=1029829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T20:31:42Z","timestamp":1584995502000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1029829\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/lics.2002.1029829","relation":{},"subject":[]}}