{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:39Z","timestamp":1725663519370},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:08:27Z","timestamp":1330254507000},"page":"408-423","source":"Crossref","is-referenced-by-count":1,"title":["Completion for constrained term rewriting systems"],"prefix":"10.1007","author":[{"given":"Charles","family":"Hoot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"31_CR1","volume-title":"Technical Report IT 207","author":"B. Bogaert","year":"1991","unstructured":"B. Bogaert and S. Tison. Automata with Equality Tests. Technical Report IT 207, Laboratoire d'Informatique Fondamental de Lille, USTL, Lille, France February 1991."},{"key":"31_CR2","unstructured":"H. Comon. Rewriting with Membership Constraints. Draft, 1992."},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"H. Comon and C. Delor. Equational Formulas in Order-Sorted Algebras. Proc. ICALP, 1990.","DOI":"10.1007\/BFb0032066"},{"key":"31_CR4","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. J. Symbolic Computation 7, pages 371\u2013425, 1989.","journal-title":"J. Symbolic Computation"},{"key":"31_CR5","first-page":"31","volume-title":"Resolution of Equations in Algebraic Structures 2: Rewriting Techniques","author":"N. Dershowitz","year":"1989","unstructured":"N. Dershowitz. Completion and Its Applications. In H. A\u00eft-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures 2: Rewriting Techniques, chapter 2, pages 31\u201386. Academic Press, New York, 1989."},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1093\/comjnl\/34.1.16","volume":"34","author":"A. J. J. J. Dick","year":"1990","unstructured":"A. J. J. Dick and P. Watson. Order-sorted Term Rewriting. Computer Journal 34, pages 16\u201319, 1990.","journal-title":"Computer Journal"},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"J. Doner. Tree Acceptors and Some of Their Applications, Journal of Computer and System Sciences 4, pages 406\u2013451, 1970.","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(91)90009-9","volume":"49","author":"A. M. Frisch","year":"1991","unstructured":"A. M. Frisch. The Substitutional Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning. Artificial Intelligence 49, pages 161\u2013198, 1991.","journal-title":"Artificial Intelligence"},{"key":"31_CR9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/947864.947865","volume":"16","author":"J. A. Goguen","year":"1981","unstructured":"J. A. Goguen and J. Meseguer, Completeness of Many-sorted Equational Logic. SIGPLAN Notices 16, pages 24\u201332, 1981.","journal-title":"SIGPLAN Notices"},{"key":"31_CR10","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. E. Knuth","year":"1970","unstructured":"D. E. Knuth and P. B. Bendix, Simple Word Problems in Universal Algebras, In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263\u2013297. Pergamon Press, Oxford, U. K. 1970."},{"key":"31_CR11","unstructured":"C. Kirchner and P. Lescanne. Solving Disequations. Proc. 2nd IEEE Symp.on Logic in Computer Science, Ithaca, NY, pages 347\u2013352, 1987."},{"key":"31_CR12","unstructured":"A. Martelli, C. Moiso, and G. F. Rossi. An Algorithm for Unification in Equational Theories. Proc. IEEE Symp. on Logic in Computer Science, Salt Lake City, UT, September 1986."},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"G. Smolka, W. Nutt, J. A. Goguen and J. Meseguer. Order-Sorted Equational Computation. In H. A\u00eft-Kaci and M Nivat, editors, Resolution of Equations in Algebraic Structures, Vol 2, Rewriting Techniques, pages 297\u2013367, Academic Press, 1989.","DOI":"10.1016\/B978-0-12-046371-8.50016-X"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Y. Toyama. Confluent Term Rewriting Systems with Membership Conditions. In S.Kaplan and J.P. Jouannaud, editors, Lecture Notes in Computer Science, 308, Conditional Term Rewriting Systems 1987 Proceedings pages 228\u2013241, Springer Verlag 1987.","DOI":"10.1007\/3-540-19242-5_17"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"T. E. Uribe. Sorted Unification Using Set Constraints. In D. Kapur, editor, Lecture Notes in Computer Science, 11th International Conference on Automated Deduction, Springer-Verlag,1992.","DOI":"10.1007\/3-540-55602-8_163"}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:37Z","timestamp":1605647017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}