{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:07:41Z","timestamp":1794341261292,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540366355","type":"print"},{"value":"9783540366362","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799573_32","type":"book-chapter","created":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T08:25:42Z","timestamp":1154939142000},"page":"423-424","source":"Crossref","is-referenced-by-count":2,"title":["Solving First-Order Constraints in the Theory of the Evaluated Trees"],"prefix":"10.1007","author":[{"given":"Thi-Bich-Hanh","family":"Dao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Khalil","family":"Djelloul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Benhamou, F., et al.: Le manuel de Prolog IV, PrologIA, Marseille, France (1996)"},{"issue":"7","key":"32_CR2","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/79204.79210","volume":"33","author":"A. Colmerauer","year":"1990","unstructured":"Colmerauer, A.: An introduction to Prolog III. Comm. of the ACM\u00a033(7), 68\u201390 (1990)","journal-title":"Comm. of the ACM"},{"key":"32_CR3","unstructured":"Comon, H.: R\u00e9solution de contraintes dans des alg\u00e8bres de termes. Rapport d\u2019Habilitation, Universit\u00e9 de Paris Sud (1992)"},{"key":"32_CR4","unstructured":"Dao, T.: R\u00e9solution de contraintes du premier ordre dans la th\u00e9orie des arbres finis ou infinis. Th\u00e8se d\u2019informatique, Universit\u00e9 de la M\u00e9diterran\u00e9e (2000)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Dao, T.B.H., Djelloul, K.: Solving First-Order Constraints in the Theory of the Evaluated Trees, Rapport de recherche LIFO RR-2006-05, http:\/\/www.univ-orleans.fr\/lifo\/rapports.php","DOI":"10.1007\/11799573_32"},{"key":"32_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/11559306_6","volume-title":"Frontiers of Combining Systems","author":"K. Djelloul","year":"2005","unstructured":"Djelloul, K.: About the Combination of Trees and Rational Numbers in a Complete First-Order Theory. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, pp. 106\u2013121. Springer, Heidelberg (2005)"},{"key":"32_CR7","unstructured":"Maher, M.: Complete axiomatization of the algebra of finite, rational and infinite trees. Technical report, IBM - T.J.Watson Research Center (1988)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-61511-3_91","volume-title":"Automated Deduction - Cade-13","author":"S. Vorobyov","year":"1996","unstructured":"Vorobyov, S.: An Improved Lower Bound for the Elementary Theories of Trees. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol.\u00a01104, pp. 275\u2013287. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799573_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:17Z","timestamp":1605625877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799573_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540366355","9783540366362"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11799573_32","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11799573","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}