{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:18Z","timestamp":1725566658039},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_9","type":"book-chapter","created":{"date-parts":[[2010,9,27]],"date-time":"2010-09-27T20:20:02Z","timestamp":1285618802000},"page":"105-119","source":"Crossref","is-referenced-by-count":0,"title":["Unification in a Class of Permutative Theories"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Boy de la Tour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mnacho","family":"Echenim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1006439522342","volume":"26","author":"J. Avenhaus","year":"2001","unstructured":"Avenhaus, J., Plaisted, D.: General algorithms for permutations in equational inference. Journal of Automated Reasoning\u00a026, 223\u2013268 (2001)","journal-title":"Journal of Automated Reasoning"},{"key":"9_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-25984-8_31","volume-title":"Automated Reasoning","author":"J. Avenhaus","year":"2004","unstructured":"Avenhaus, J.: Efficient algorithms for computing modulo permutation theories. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 415\u2013429. Springer, Heidelberg (2004)"},{"key":"9_CR3","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":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-39813-4_23","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Boy de la Tour","year":"2003","unstructured":"Boy de la Tour, T., Echenim, M.: NP-completeness results for deductive problems on stratified terms. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 315\u2013329. Springer, Heidelberg (2003)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"de la Tour, T.B., Echenim, M.: On the complexity of deduction modulo leaf permutative equations. To appear in Journal of Automated Reasoning (2004)","DOI":"10.1007\/978-3-540-25984-8_32"},{"key":"9_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-25984-8_32","volume-title":"Automated Reasoning","author":"T.B. Tour de la","year":"2004","unstructured":"de la Tour, T.B., Echenim, M.: Overlapping leaf permutative equations. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 430\u2013444. Springer, Heidelberg (2004)"},{"key":"9_CR7","volume-title":"Computers and intractability: a guide to the theory of NP -completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and intractability: a guide to the theory of NP -completeness. Freeman, San Francisco (1979)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:34:02Z","timestamp":1605742442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}