{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:58:12Z","timestamp":1725890292822},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851097"},{"type":"electronic","value":"9783540851103"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85110-3_9","type":"book-chapter","created":{"date-parts":[[2008,7,26]],"date-time":"2008-07-26T02:00:32Z","timestamp":1217037632000},"page":"93-108","source":"Crossref","is-referenced-by-count":2,"title":["A Full First-Order Constraint Solver for Decomposable Theories"],"prefix":"10.1007","author":[{"given":"Khalil","family":"Djelloul","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of constraint programming","author":"K. Apt","year":"2003","unstructured":"Apt, K.: Principles of constraint programming. Cambridge University Press, Cambridge (2003)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Clark, K.L.: Negation as failure. In: Ed Gallaire, H., Minker, J. (eds.) Logic and Data bases. Plenum Pub. (1978)","DOI":"10.1007\/978-1-4684-3384-5_11"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1025675127871","volume":"8","author":"A. Colmerauer","year":"2003","unstructured":"Colmerauer, A., Dao, T.: Expressiveness of full first-order constraints in the algebra of finite or infinite trees. Journal of Constraints\u00a08(3), 283\u2013302 (2003)","journal-title":"Journal of Constraints"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Djelloul, K., Dao, T., Fruehwirth, T.: Theory of finite or infinite trees revisited. Theory and practice of logic programming (TPLP) (to appear, 2008)","DOI":"10.1017\/S1471068407003171"},{"issue":"5","key":"9_CR5","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1017\/S1471068406002997","volume":"7","author":"K. Djelloul","year":"2007","unstructured":"Djelloul, K.: Decomposable theories. Theory and practice of logic programming (TPLP)\u00a07(5), 583\u2013632 (2007)","journal-title":"Theory and practice of logic programming (TPLP)"},{"key":"9_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/11856290_7","volume-title":"Artificial Intelligence and Symbolic Computation","author":"K. Djelloul","year":"2006","unstructured":"Djelloul, K., Dao, T.: Extension into trees of first-order theories. In: Calmet, J., Ida, T., Wang, D. (eds.) AISC 2006. LNCS (LNAI), vol.\u00a04120, pp. 53\u201367. Springer, Heidelberg (2006)"},{"key":"9_CR7","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":"9_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05138-2","volume-title":"Essentials of Constraint Programming","author":"T. Fruehwirth","year":"2003","unstructured":"Fruehwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2003)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Maher, M.: Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. In: Proc. of LICS 1988, pp. 348\u2013357 (1988)","DOI":"10.1109\/LICS.1988.5132"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/371316.371494","volume":"2","author":"T. Rybina","year":"2001","unstructured":"Rybina, T., Voronkov, A.: A decision procedure for term algebras with queues. ACM transaction on computational logic\u00a02(2), 155\u2013181 (2001)","journal-title":"ACM transaction on computational logic"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-51305-1_24","volume-title":"Mathematics of Program Construction","author":"J. Spivey","year":"1989","unstructured":"Spivey, J.: A Categorial Approch to the Theory of Lists. In: van de Snepscheut, J.L.A. (ed.) MPC 1989. LNCS, vol.\u00a0375, pp. 399\u2013408. Springer, Heidelberg (1989)"},{"key":"9_CR12","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","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85110-3_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:58Z","timestamp":1619507698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85110-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851097","9783540851103"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85110-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}