{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:49Z","timestamp":1725455929417},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013843","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"446-457","source":"Crossref","is-referenced-by-count":1,"title":["On n-syntactic equational theories"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Boudet","sequence":"first","affiliation":[]},{"given":"Evelyne","family":"Contejean","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"S. Arnborg and E. Tid\u00e9n. Unification problems with one-sided distributivity. In Proc. Rewriting Techniques and Applications 85, Dijon, LNCS 202. Springer-Verlag, May 1985.","DOI":"10.1007\/3-540-15976-2_20"},{"key":"29_CR2","volume-title":"Research Report","author":"H. Comon","year":"1991","unstructured":"H. Comon, M. Haberstrau, and J.-P. Jouannaud. Decidable properties of shallow equational theories. In Proc. 7th IEEE Symp. Logic in Computer Science, Santa Cruz, 1992. Also Research Report, Dec. 1991, Laboratoire de Recherche en Informatique, Orsay, France."},{"issue":"3","key":"29_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279\u2013301, March 1982.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"29_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Nachum Dershowitz. Termination of rewriting. J. Symbolic Computation, 3(1):69\u2013115, February 1987.","journal-title":"J. Symbolic Computation"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243\u2013309. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"29_CR6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(89)90004-2","volume":"67","author":"J. Gallier","year":"1989","unstructured":"J. Gallier and W. Snyder. Complete sets of transformations for general E-unification. Theoretical Computer Science, 67:203\u2013260, 1989.","journal-title":"Theoretical Computer Science"},{"key":"29_CR7","unstructured":"C. Kirchner. Computing unification algorithms. In Proc. 1st IEEE Symp. Logic in Computer Science, Cambridge, Mass., pages 206\u2013216, 1986."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"C. Kirchner and F. Klay. Syntactic theories and unification. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, June 1990.","DOI":"10.1109\/LICS.1990.113753"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"F. Klay. Undecidable properties of syntactic theories. In Proc. 4th Rewriting Techniques and Applications 91, Como, LNCS 488, 1991.","DOI":"10.1007\/3-540-53904-2_92"},{"issue":"4","key":"29_CR10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1147\/rd.254.0327","volume":"25","author":"D. Kozen","year":"1981","unstructured":"D. Kozen. Positive first order logic is NP-complete. IBM Journal of Res. Developp., 25(4):327\u2013332, July 1981.","journal-title":"IBM Journal of Res. Developp."},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"T. Nipkow. Proof transformations for equational theories. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, June 1990.","DOI":"10.1109\/LICS.1990.113754"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013843.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:08:14Z","timestamp":1607353694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013843"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0013843","relation":{},"subject":[]}}