{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:56Z","timestamp":1725489356545},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73449-9_7","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"63-77","source":"Crossref","is-referenced-by-count":0,"title":["Determining Unify-Stable Presentations"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Boy de la Tour","sequence":"first","affiliation":[]},{"given":"Mnacho","family":"Echenim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"7_CR2","unstructured":"Boy de la Tour, T., Echenim, M.: Determining unify-stable presentations (long version), \n                  \n                    http:\/\/www-leibniz.imag.fr\/~boydelat\/papers\/"},{"key":"7_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/978-3-540-25984-8_32","volume-title":"Automated Reasoning","author":"T. Boy de la Tour","year":"2004","unstructured":"Boy de la Tour, T., Echenim, M.: Overlapping leaf permutative equations. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 430\u2013444. Springer, Heidelberg (2004)"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1016\/j.ic.2006.11.001","volume":"25","author":"T. Boy de la Tour","year":"2007","unstructured":"Boy de la Tour, T., Echenim, M.: Permutative rewriting and unification. Information and Computation\u00a025(4), 624\u2013650 (2007)","journal-title":"Information and Computation"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Fundamental Algorithms for Permutation Groups","year":"1991","unstructured":"Butler, G. (ed.): Fundamental Algorithms for Permutation Groups. LNCS, vol.\u00a0559. Springer, Heidelberg (1991)"},{"key":"7_CR6","unstructured":"The GAP\u00a0Group. GAP \u2013 Groups, Algorithms, and Programming, Version 4.4 (2006), \n                  \n                    http:\/\/www.gap-system.org"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Group-Theoretic Algorithms and Graph Isomorphism","year":"1982","unstructured":"Hoffmann, C. (ed.): Group-Theoretic Algorithms and Graph Isomorphism. LNCS, vol.\u00a0136. Springer, Heidelberg (1982)"},{"key":"7_CR8","first-page":"11","volume-title":"LICS 1992","author":"D. Kapur","year":"1992","unstructured":"Kapur, D., Narendran, P.: Double-exponential complexity of computing a complete set of ac-unifiers. In: Scedrov, A. (ed.) LICS 1992, pp. 11\u201321. IEEE Computer Society Press, Washington, DC, USA (1992)"},{"key":"7_CR9","first-page":"270","volume-title":"LICS 1990","author":"C. Kirchner","year":"1990","unstructured":"Kirchner, C., Klay, F.: Syntactic theories and unification. In: Mitchell, J. (ed.) LICS 1990, pp. 270\u2013277. IEEE Computer Society Press, Washington, DC, USA (1990)"},{"key":"7_CR10","unstructured":"Lankford, D.S., Ballantyne, A.: Decision procedures for simple equational theories with permutative axioms: complete sets of permutative reductions. Technical report, Univ. of Texas at Austin, Dept. of Mathematics and Computer Science (1977)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1005764526878","volume":"19","author":"P. Narendran","year":"1997","unstructured":"Narendran, P., Otto, F.: Single versus simultaneous equational unification and equational unification for variable-permuting theories. J. Autom. Reasoning\u00a019(1), 87\u2013115 (1997)","journal-title":"J. Autom. Reasoning"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2730","volume":"147","author":"R. Nieuwenhuis","year":"1998","unstructured":"Nieuwenhuis, R.: Decidability and complexity analysis by basic paramodulation. Information and Computation\u00a0147(1), 1\u201321 (1998)","journal-title":"Information and Computation"},{"key":"7_CR13","first-page":"274","volume":"34","author":"M. Schmidt-Schau\u00df","year":"1988","unstructured":"Schmidt-Schau\u00df, M.: Solution to problems p140 and p141. Bulletin of the EATCS\u00a034, 274\u2013275 (1988)","journal-title":"Bulletin of the EATCS"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0747-7171(89)80037-9","volume":"8","author":"M. Schmidt-Schau\u00df","year":"1989","unstructured":"Schmidt-Schau\u00df, M.: Unification in permutative equational theories is undecidable. J. Symb. Comput.\u00a08(4), 415\u2013421 (1989)","journal-title":"J. Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:01:22Z","timestamp":1558486882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734475","9783540734499"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}