{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:57:19Z","timestamp":1743116239116,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_29","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"331-343","source":"Crossref","is-referenced-by-count":21,"title":["Future-Looking Logics on Data Words and Trees"],"prefix":"10.1007","author":[{"given":"Diego","family":"Figueira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Segoufin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. J. ACM\u00a055(2) (2008)","DOI":"10.1145\/1346330.1346333"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-85238-4_10","volume-title":"Mathematical Foundations of Computer Science 2008","author":"H. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, H., Martens, W., Schwentick, T.: Optimizing conjunctive queries over trees using schema information. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 132\u2013143. Springer, Heidelberg (2008)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS, pp. 10\u201319 (2006)","DOI":"10.1145\/1142351.1142354"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS, pp. 7\u201316 (2006)","DOI":"10.1109\/LICS.2006.51"},{"issue":"2","key":"29_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0890-5401(03)00038-5","volume":"182","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P., Petit, A., Th\u00e9rien, D.: An algebraic approach to data languages and timed languages. Inf. Comput.\u00a0182(2), 137\u2013162 (2003)","journal-title":"Inf. Comput."},{"key":"29_CR6","unstructured":"Clark, J., DeRose, S.: XML path language (XPath) (1999), W3C Recommendation, http:\/\/www.w3.org\/TR\/xpath"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-85238-4_22","volume-title":"Mathematical Foundations of Computer Science 2008","author":"C. David","year":"2008","unstructured":"David, C.: Complexity of data tree patterns over XML documents. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 278\u2013289. Springer, Heidelberg (2008)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic (2009)","DOI":"10.1145\/1507244.1507246"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazi\u0107, R., Nowak, D.: On the freeze quantifier in constraint LTL: Decidability and complexity. In: TIME, pp. 113\u2013121 (2005)","DOI":"10.1109\/TIME.2005.28"},{"key":"29_CR10","volume-title":"PODS","author":"D. Figueira","year":"2009","unstructured":"Figueira, D.: Satisfiability of downward XPath with data equality tests. In: PODS, Providence, Rhode Island, USA. ACM Press, New York (2009)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11601524_8","volume-title":"Database Programming Languages","author":"F. Geerts","year":"2005","unstructured":"Geerts, F., Fan, W.: Satisfiability of XPath queries with sibling axes. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol.\u00a03774, pp. 122\u2013137. Springer, Heidelberg (2005)"},{"key":"29_CR12","unstructured":"Jurdzi\u0144ski, M., Lazi\u0107, R.: Alternating automata on data trees and XPath satisfiability. CoRR, abs\/0805.0330 (2008)"},{"key":"29_CR13","volume-title":"Computation: finite and infinite machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Englewood Cliffs (1967)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11690634_15","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.: On Metric temporal logic and faulty Turing machines. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 217\u2013230. Springer, Heidelberg (2006)"},{"issue":"5","key":"29_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","volume":"83","author":"P. Schnoebelen","year":"2002","unstructured":"Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters\u00a083(5), 251\u2013261 (2002)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T19:57:28Z","timestamp":1739303848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}