{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:14:07Z","timestamp":1725758047210},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642451133"},{"type":"electronic","value":"9783642451140"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45114-0_7","type":"book-chapter","created":{"date-parts":[[2013,11,22]],"date-time":"2013-11-22T00:10:42Z","timestamp":1385079042000},"page":"80-91","source":"Crossref","is-referenced-by-count":5,"title":["Expressive Reasoning on Tree Structures: Recursion, Inverse Programs, Presburger Constraints and Nominals"],"prefix":"10.1007","author":[{"given":"Everardo","family":"B\u00e1rcenas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jes\u00fas","family":"Lavalle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"B\u00e1rcenas, E., Genev\u00e8s, P., Laya\u00efda, N., Schmitt, A.: Query reasoning on trees with types, interleaving, and counting. In: Walsh, T. (ed.) IJCAI, pp. 718\u2013723. IJCAI\/AAAI (2011)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/11787006_46","volume-title":"Automata, Languages and Programming","author":"P.A. Bonatti","year":"2006","unstructured":"Bonatti, P.A., Lutz, C., Murano, A., Vardi, M.Y.: The complexity of enriched \u03bc-calculi. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 540\u2013551. Springer, Heidelberg (2006)"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.artint.2004.04.012","volume":"158","author":"P.A. Bonatti","year":"2004","unstructured":"Bonatti, P.A., Peron, A.: On the undecidability of logics with converse, nominals, recursion and counting. Artif. Intell.\u00a0158(1), 75\u201396 (2004)","journal-title":"Artif. Intell."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Node selection query languages for trees. In: Fox, M., Poole, D. (eds.) AAAI. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7598"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.jal.2010.03.001","volume":"8","author":"S. Demri","year":"2010","unstructured":"Demri, S., Lugiez, D.: Complexity of modal logics with Presburger constraints. J. Applied Logic\u00a08(3), 233\u2013252 (2010)","journal-title":"J. Applied Logic"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00236-009-0108-5","volume":"47","author":"P. Habermehl","year":"2010","unstructured":"Habermehl, P., Iosif, R., Vojnar, T.: Automata-based verification of programs with tree updates. Acta Inf.\u00a047(1), 1\u201331 (2010)","journal-title":"Acta Inf."},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/1053468.1053470","volume":"27","author":"H. Hosoya","year":"2005","unstructured":"Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. ACM Trans. Program. Lang. Syst.\u00a027(1), 46\u201390 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-72734-7_26","volume-title":"Logical Foundations of Computer Science","author":"Z. Manna","year":"2007","unstructured":"Manna, Z., Sipma, H.B., Zhang, T.: Verifying balanced trees. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 363\u2013378. Springer, Heidelberg (2007)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: Neven, F., Beeri, C., Milo, T. (eds.) PODS, pp. 155\u2013166. ACM (2003)","DOI":"10.1145\/773153.773169"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1007\/978-3-540-27836-8_94","volume-title":"Automata, Languages and Programming","author":"H. Seidl","year":"2004","unstructured":"Seidl, H., Schwentick, T., Muscholl, A., Habermehl, P.: Counting in trees for free. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1136\u20131149. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45114-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T05:04:19Z","timestamp":1688792659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45114-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642451133","9783642451140"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45114-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}