{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:06Z","timestamp":1725460026054},"publisher-location":"Boston","reference-count":14,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_30","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"381-394","source":"Crossref","is-referenced-by-count":3,"title":["On Complexity of Model-Checking for the TQL Logic"],"prefix":"10.1007","author":[{"given":"Iovka","family":"Boneva","sequence":"first","affiliation":[]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Abiteboul, S., Buneman, P., and Suciu, D. (2000). Data on the Web. Morgan Kaufmann Publishers.","key":"30_CR1"},{"doi-asserted-by":"crossref","unstructured":"Cardelli, L. (2000). semistructured Computation. In 7th International Workshop on Database Programming Languages, DBPL\u201999, LNCS, pages 1\u201316. Springer.","key":"30_CR2","DOI":"10.1007\/3-540-44543-9_1"},{"key":"30_CR3","first-page":"1","volume":"2028","author":"L. Cardelli","year":"2001","unstructured":"Cardelli, L. and Ghelli, G. (2001). A Query Language Based on the Ambient Logic. In European Symposium on Programming (ESOP\u201901), volume 2028 of LNCS, pages 1\u201322. Springer.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"Cardelli, L. and Gordon, A.D. (2000a). Anytime, Anywhere: Modal Logics for Mobile Ambients. In 27th ACM Symposium on Principles of Programming Languages (POPL\u201900), pages 365\u2013377.","key":"30_CR4","DOI":"10.1145\/325694.325742"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L. and Gordon, A.D. (2000b). Mobile Ambients. Theoretical Computer Science, 240:177\u2013213.","journal-title":"Theoretical Computer Science"},{"key":"30_CR6","first-page":"152","volume":"2030","author":"W. Charatonik","year":"2001","unstructured":"Charatonik, W., Dal Zilio, S., Gordon, A. D., Mukhopadhyay, S., and Talbot, J.-M. (2001). The Complexity of Model Checking Mobile Ambients. In Foundations of Software Science and Computation Structures (FoSSaCS\u201901), volume 2030 of LNCS, pages 152\u2013167. Springer.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"Courcelle, B. (1990a). Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, volume B. Elsevier.","key":"30_CR7","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"issue":"1","key":"30_CR8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B. (1990b). The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Information and Computatution, 85(1): 12\u201375.","journal-title":"Information and Computatution"},{"doi-asserted-by":"crossref","unstructured":"Dal-Zilio, S. and Lugiez, D. (2003). XML Schema, Tree Logic and Sheaves Automata. In Rewriting Techniques and Applications, 14th International Conference, RTA 2003, LNCS, pages 246\u2013263. Springer.","key":"30_CR9","DOI":"10.1007\/3-540-44881-0_18"},{"key":"30_CR10","first-page":"2","volume":"2471","author":"F. Neven","year":"2002","unstructured":"Neven, F. (2002). Automata, Logic and XML. In Annual Conference of the European Association for Computer Science Logic (CSL\u2019 02), volume 2471 of LNCS, pages 2\u201326. Springer.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"Seidl, H., Schwentick, T., and Muscholl, A. (2003). Numerical Document Queries. In Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 155\u2013166. ACM.","key":"30_CR11","DOI":"10.1145\/773153.773169"},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(90)90110-4","volume":"89","author":"C. Stirling","year":"1991","unstructured":"Stirling, C. and Walker, D. (1991). Local model checking in the modal mu-calculus. Theoretical Computer Science, 89:161\u2013177.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. J. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L. J. (1976). The Polynomial-time Hierarchy. Theoretical Computer Science, 3(1): 1\u201322.","journal-title":"Theoretical Computer Science"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(91)90043-2","volume":"83","author":"G. Winskel","year":"1991","unstructured":"Winskel, G. (1991). A note on model checking the modal \u03c5-calculas. Theoretical Computer Science, 83:157\u2013167.","journal-title":"Theoretical Computer Science"}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:28:16Z","timestamp":1619555296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_30","relation":{},"subject":[]}}