{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:10:01Z","timestamp":1737364201896,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439318"},{"type":"electronic","value":"9783540456209"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45620-1_37","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T07:18:26Z","timestamp":1186903106000},"page":"471-485","source":"Crossref","is-referenced-by-count":13,"title":["Basic Syntactic Mutation"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Lynch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Morawska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,4]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge, 1998.","DOI":"10.1017\/CBO9781139172752"},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/logcom\/4.3.217","volume":"4","author":"L. Bachmair","year":"1994","unstructured":"L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. In Journal of Logic and Computation 4(3), 1\u201331, 1994.","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/inco.1995.1131","volume":"121","author":"L. Bachmair","year":"1995","unstructured":"L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic Paramodulation. Information and Computation Vol. 121, No. 2 (1995) pp. 172\u2013192.","journal-title":"Information and Computation"},{"issue":"1","key":"37_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1994.1043","volume":"111","author":"H. Comon","year":"1994","unstructured":"H. Comon, M. Haberstrau and J.-P. Jouannaud. Syntacticness, Cycle-Syntacticness and shallow theories. In Information and Computation 111(1), 154\u2013191, 1994.","journal-title":"Information and Computation"},{"key":"37_CR5","volume-title":"Proceedings 13th International Conference on Automated Deduction","author":"Q. Guo","year":"1996","unstructured":"Q. Guo, P. Narendran and D. Wolfram. Unification and Matching modulo Nilpotence. In Proceedings 13th International Conference on Automated Deduction, Rutgers University, NJ, 1996."},{"key":"37_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"Proc. 5th Int. Conf. on Automated Deduction","author":"J.-M. Hullot","year":"1980","unstructured":"J.-M. Hullot. Canonical forms and unification. In Proc. 5th Int. Conf. on Automated Deduction, LNCS, vol. 87, pp. 318\u2013334, Berlin, 1980. Springer-Verlag."},{"key":"37_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Rewriting Techniques and Applications, 7th International Conference, RTA-96","author":"F. Jacquemard","year":"1996","unstructured":"F. Jacquemard. Decidable approximations of term rewriting systems. In H. Ganzinger, ed., Rewriting Techniques and Applications, 7th International Conference, RTA-96, LNCS, vol. 1103, Springer, 362\u2013376, 1996."},{"key":"37_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BFb0052362","volume-title":"Rewriting Techniques and Applications, 9th International Conference, RTA-98","author":"F. Jacquemard","year":"1998","unstructured":"F. Jacquemard, Ch. Meyer, Ch. Weidenbach. Unification in Extensions of Shallow Equational Theories. In T. Nipkow, ed., Rewriting Techniques and Applications, 9th International Conference, RTA-98, LNCS, vol. 1379, Springer, 76\u201390, 1998."},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"D. Kapur and P. Narendran. Matching, Unification, and Complexity. In SIGSAM Bulletin, 1987.","DOI":"10.1145\/36330.36332"},{"key":"37_CR10","unstructured":"C. Kirchner. Computing unification algorithms. In Proceedings of the Fourth Symposium on Logic in Computer Science, Boston, 200\u2013216, 1990."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"D.E. Knuth and P. B. Bendix. Simple word problems in universal algebra. In Computational Problems in Abstract Algebra, ed. J. Leech, 263\u2013297, Pergamon Press, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"37_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.46298\/dmtcs.240","volume":"1","author":"S. Limet","year":"1997","unstructured":"S. Limet and P. R\u00e9ty. E-unification by Means of Tree Tuple Synchronized Grammars. In Discrete Mathematics and Theoretical Computer Science, volume 1, pp. 69\u201398, 1997.","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"37_CR13","unstructured":"C. Lynch and B. Morawska. http:\/\/www.clarkson.edu\/~clynch\/papers\/bsmfull.ps\/ , 2002."},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"R. Nieuwenhuis. Basic paramodulation and decidable theories. (Extended abstract), In Proceedings 11th IEEE Symposium on Logic in Computer Science, LICS\u201996, IEEE Computer Society Press, 473\u2013482, 1996.","DOI":"10.1109\/LICS.1996.561464"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"R. Nieuwenhuis and A. Rubio. Basic Superposition is Complete. In Proc. European Symposium on Programming, Rennes, France (1992).","DOI":"10.1007\/3-540-55253-7_22"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction\u2014CADE-18"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45620-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:52:01Z","timestamp":1737363121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45620-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439318","9783540456209"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45620-1_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}