{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:21Z","timestamp":1742598621382,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591559"},{"type":"electronic","value":"9783540492009"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59155-9_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:04:24Z","timestamp":1330275864000},"page":"62-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constraints in term algebras an overview of constraint solving techniques"],"prefix":"10.1007","author":[{"given":"Hubert","family":"Comon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"4_CR1","unstructured":"R. Backofen and G. Smolka. A complete and recursive feature theory. Research Report RR-92-30, DFKI, Saarbr\u00fccken, Sept. 1992. To appear in Theoretical Computer Science."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"R. Backofen and R. Treinen. How to win a game with features. In J.-P. Jouannaud, editor, Proc. Int. Conf. on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 320\u2013335. Springer-Verlag, Sept. 1994.","DOI":"10.1007\/BFb0016863"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1006\/jsco.1993.1066","volume":"16","author":"A. Boudet","year":"1993","unstructured":"A. Boudet. Combining unification algorithms. Journal of Symbolic Computation, 16:597\u2013626, 1993.","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR4","volume-title":"Lecture Notes in Computer Science, vol. 690","author":"A.-C. Caron","year":"1993","unstructured":"A.-C. Caron, J.-L. Coquid\u00e9, and M. Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proc. 5th. Int. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 690, Montreal, Canada, 1993. Springer-Verlag."},{"key":"4_CR5","unstructured":"H. Comon. Disunification: a survey. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, 1991."},{"key":"4_CR6","volume-title":"Constraints in term algebras (short survey)","author":"H. Comon","year":"1993","unstructured":"H. Comon. Constraints in term algebras (short survey). In T. R. M. Nivat, C. Rattray and G. Scollo, editors, Proc. Conf. on Algebraic Methodology and Software Technology, Univ. of Twente, 1993. Springer Verlag, series Workshop in Computing. Invited talk."},{"issue":"2","key":"4_CR7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1006\/inco.1994.1056","volume":"112","author":"H. Comon","year":"1994","unstructured":"H. Comon and C. Delor. Equational formulae with membership constraints. Information and Computation, 112(2):167\u2013216, Aug. 1994.","journal-title":"Information and Computation"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"H. Comon, M. Haberstrau, and J.-P. Jouannaud. Syntacticness, cycle-syntacticness and shallow theories. Information and Computation, 111(1), May 1994.","DOI":"10.1006\/inco.1994.1043"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","volume":"7","author":"H. Comon","year":"1989","unstructured":"H. Comon and P. Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371\u2013425, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR10","volume-title":"Ordering constraints on trees","author":"H. Comon","year":"1994","unstructured":"H. Comon and R. Treinen. Ordering constraints on trees. In S. Tison, editor, Proc. CAAP 94, LNCS, Edinburgh, Apr. 1994. Springer Verlag. (Invited Lecture)."},{"key":"4_CR11","volume-title":"Lecture Notes in Computer Science","author":"M. Dauchet","year":"1994","unstructured":"M. Dauchet. Rewriting and tree automata. In H. Comon and J.-P. Jouannaud, editors, Proc. Spring School on Theoretical Computer Science: Rewriting, Lecture Notes in Computer Science, to appear, Odeillo, France, 1994. Springer-Verlag."},{"key":"4_CR12","unstructured":"T. Fr\u00fchwirth. Constraint simplification rules. Technical report, ECRC Munchen, 1992."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints using tree automata. In Proc. 10th Symposium on Theoretical Aspects of Computer Science, W\u00fcrzburg, LNCS, 1993.","DOI":"10.1007\/3-540-56503-5_50"},{"key":"4_CR14","first-page":"372","volume-title":"Solving systems of set constraints with negated subset relationships","author":"R. Gilleron","year":"1993","unstructured":"R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. In Proc. 34th Symposium on Foundations of Computer Science, pages 372\u2013380, Palo Alto, CA, Nov. 1993. IEEE Computer society press."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"J.-P. Jouannaud, editor. Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science. Springer-Verlag, 1994.","DOI":"10.1007\/BFb0016839"},{"key":"4_CR16","unstructured":"J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, 1991."},{"key":"4_CR17","unstructured":"D. Kapur and P. Narendran. Double-exponential complexity of computing a complete set of ac-unifiers. In Proc. 7th IEEE Symp. Logic in Computer Science, Santa Cruz, June 1992."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"M. J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, pages 348\u2013357, July 1988.","DOI":"10.1109\/LICS.1988.5132"},{"key":"4_CR19","unstructured":"A. Mal'cev. On the elementary theories of locally free algebras. Soviet Math. Doklady, 1961."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"M. Rabin. Decidable theories. In J. Barwise, editor, Handbook of Mathematical Logic, pages 595\u2013629. North-Holland, 1977.","DOI":"10.1016\/S0049-237X(08)71116-9"},{"key":"4_CR21","volume-title":"Th\u00e8se de Doctorat","author":"C. Ringeissen","year":"1993","unstructured":"C. Ringeissen. Combinaison de r\u00e9solutions de contraintes. Th\u00e8se de Doctorat, Universit\u00e9 de Nancy I, France, Dec. 1993."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"M. Schmidt-Schau\u00df. Unification in a combination of arbitrary disjoint equational theories. Journal of Symbolic Computation, 1990. Special issue on Unification.","DOI":"10.1016\/S0747-7171(89)80022-7"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 134\u2013191. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"container-title":["Lecture Notes in Computer Science","Constraint Programming: Basics and Trends"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59155-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:43:08Z","timestamp":1742596988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59155-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591559","9783540492009"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-59155-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}