{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:48Z","timestamp":1725490248561},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_13","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"130-145","source":"Crossref","is-referenced-by-count":4,"title":["Satisfiability of a Spatial Logic with Tree Variables"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Filiot","sequence":"first","affiliation":[]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[]},{"given":"Sophie","family":"Tison","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Benzaken, V., Castagna, G., Frisch, A.: CDuce: an XML-centric general-purpose language. In: 8th ACM International Conf. on Functional Programming, pp. 51\u201363 (2003)","DOI":"10.1145\/944705.944711"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","first-page":"161","volume-title":"STACS 1992","author":"B. Bogaert","year":"1992","unstructured":"Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 161\u2013171. Springer, Heidelberg (1992)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and xml reasoning. In: ACM 25th Symp. on Principles of database systems, pp. 10\u201319 (2006)","DOI":"10.1145\/1142351.1142354"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Boneva, I., Talbot, J.M., Tison, S.: Expressiveness of a spatial logic for trees. In: 20th IEEE Symposium on Logic in Computer Science, pp. 280\u2013289 (2005)","DOI":"10.1109\/LICS.2005.17"},{"key":"13_CR5","unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular tree languages over non-ranked alphabets, 1998 (unpublished manuscript)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45465-9_51","volume-title":"Automata, Languages and Programming","author":"L. Cardelli","year":"2002","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 597\u2013610. Springer, Heidelberg (2002)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1017\/S0960129504004141","volume":"14","author":"L. Cardelli","year":"2004","unstructured":"Cardelli, L., Ghelli, G.: TQL: A Query Language for Semistructured Data Based on the Ambient Logic. Mathematical Structures in Computer Science\u00a014, 285\u2013327 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44802-0_24","volume-title":"Computer Science Logic","author":"W. Charatonik","year":"2001","unstructured":"Charatonik, W., Talbot, J.: The Decidability of Model Checking Mobile Ambients. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 339\u2013354. Springer, Heidelberg (2001)"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.tcs.2004.09.036","volume":"331","author":"H. Comon","year":"2005","unstructured":"Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. TCS\u00a0331(1), 143\u2013214 (2005)","journal-title":"TCS"},{"key":"13_CR10","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications, 1997 (October 1, 2002)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Dauchet, M., Caron, A.-C., Coquid\u00e9, J.-L.: Reduction properties and automata with constraints\u00a020, 215\u2013233 (1995)","DOI":"10.1006\/jsco.1995.1048"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Dawar, A., Gardner, P., Ghelli, G.: Expressiveness and complexity of graph logic. In: Information and Computation, vol.\u00a0205, pp. 263\u2013310 (2007)","DOI":"10.1016\/j.ic.2006.10.006"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/767193.767195","volume":"3","author":"H. Hosoya","year":"2003","unstructured":"Hosoya, H., Pierce, B.C.: XDuce: A statically typed xml processing language. ACM Trans. Internet Techn.\u00a03(2), 117\u2013148 (2003)","journal-title":"ACM Trans. Internet Techn."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. Research Report LSV-06-07, LSV, ENS Cachan, France (2006)","DOI":"10.1007\/11814771_45"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Karianto, W., L\u00f6ding, C.: Unranked tree automata with sibling equalities and disequalities. In: 34th International Colloquium on Automata, Languages and Programming (2007)","DOI":"10.1007\/978-3-540-73420-8_75"},{"key":"13_CR16","unstructured":"Mongy, J.: Transformation de noyaux reconnaissables d\u2019arbres. For\u00eats RATEG. PhD thesis, Universit\u00e9 de Lille (1981)"},{"key":"13_CR17","unstructured":"Murata, M.: Hedge automata: A formal model for xml schemata. Technical report, Fuji Xerox Information Systems (1999)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/3-540-44683-4_49","volume-title":"Mathematical Foundations of Computer Science 2001","author":"F. Neven","year":"2001","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Towards regular languages over infinite alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 560\u2013572. Springer, Heidelberg (2001)"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/LICS.2002.1029817","volume-title":"17th IEEE Symp. on Logic in Computer Science","author":"J.C. Reynolds","year":"2002","unstructured":"Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: 17th IEEE Symp. on Logic in Computer Science, pp. 55\u201374. IEEE, Los Alamitos (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:44Z","timestamp":1619520344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}