{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:12:09Z","timestamp":1794348729956,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540738169","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73817-6_9","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T23:59:13Z","timestamp":1187395153000},"page":"139-153","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees"],"prefix":"10.1007","author":[{"given":"Marc","family":"Meister","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Khalil","family":"Djelloul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thom","family":"Fr\u00fchwirth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","first-page":"231","volume-title":"Logic Programming","author":"A. Colmerauer","year":"1982","unstructured":"Colmerauer, A.: Prolog and infinite trees. In: Clark, K.L., T\u00e4rnlund, S.-A. (eds.) Logic Programming, pp. 231\u2013251. Academic Press, London (1982)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Djelloul, K.: Decomposable theories. J. Theory and Practice of Logic Programming (to appear)","DOI":"10.1017\/S1471068406002997"},{"issue":"1-3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and Practice of Constraint Handling Rules. J. Logic Programming\u00a037(1-3), 95\u2013138 (1998)","journal-title":"J. Logic Programming"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/11562931_11","volume-title":"Logic Programming","author":"T. Fr\u00fchwirth","year":"2005","unstructured":"Fr\u00fchwirth, T.: Parallelizing union-find in Constraint Handling Rules using confluence. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 113\u2013127. Springer, Heidelberg (2005)"},{"key":"9_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05138-2","volume-title":"Essentials of Constraint Programming","author":"T. Fr\u00fchwirth","year":"2003","unstructured":"Fr\u00fchwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2003)"},{"key":"9_CR6","unstructured":"Herbrand, J.: Recherches sur la th\u00e9orie de la demonstration. PhD thesis, Universit\u00e9 de Paris, France (1930)"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems. J. ACM\u00a027(4), 797\u2013821 (1980)","journal-title":"J. ACM"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Maher, M.J.: Complete axiomatizations of the algebras of finite, rational, and infinite trees. In: LICS 1988, pp. 348\u2013357, Los Alamitos (CA), USA (1988)","DOI":"10.1109\/LICS.1988.5132"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Trans. Program. Lang. Syst.\u00a04(2), 258\u2013282 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR10","unstructured":"Meister, M., Fr\u00fchwirth, T.: Complexity of the CHR rational tree equation solver. In: CHR 2006, Report CW, vol. 452, pp. 77\u201392. K.U. Leuven, Belgium (2006)"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M.S. Paterson","year":"1978","unstructured":"Paterson, M.S., Wegman, M.N.: Linear unification. J. Computer and System Sciences\u00a016(2), 158\u2013167 (1978)","journal-title":"J. Computer and System Sciences"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM\u00a012(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"issue":"1&2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1017\/S1471068405002541","volume":"6","author":"T. Schrijvers","year":"2006","unstructured":"Schrijvers, T., Fr\u00fchwirth, T.: Optimal union-find in Constraint Handling Rules. J. Theory and Practice of Logic Programming\u00a06(1&2), 213\u2013224 (2006)","journal-title":"J. Theory and Practice of Logic Programming"},{"key":"9_CR14","unstructured":"Schrijvers, T., et al.: Constraint Handling Rules (CHR) web page (2007), \n                    \n                      http:\/\/www.cs.kuleuven.ac.be\/~dtai\/projects\/CHR\/"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Van Leeuwen, J.: Worst-case analysis of set union algorithms. J. ACM\u00a031(2), 245\u2013281 (1984)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73817-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:00:34Z","timestamp":1619503234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73817-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738169"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73817-6_9","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-73817-6","asserted-by":"object"}]},"subject":[]}}