{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:29:17Z","timestamp":1725892157554},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642313646"},{"type":"electronic","value":"9783642313653"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31365-3_32","type":"book-chapter","created":{"date-parts":[[2012,6,21]],"date-time":"2012-06-21T20:35:34Z","timestamp":1340310934000},"page":"408-422","source":"Crossref","is-referenced-by-count":2,"title":["New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants"],"prefix":"10.1007","author":[{"given":"Andrew M.","family":"Marshall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_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, New York (1998)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Alan Robinson, J., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 445\u2013532. Elsevier, MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-642-02348-4_26","volume-title":"Rewriting Techniques and Applications","author":"A. Gasc\u00f3n","year":"2009","unstructured":"Gasc\u00f3n, A., Godoy, G., Schmidt-Schau\u00df, M.: Unification with Singleton Tree Grammars. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 365\u2013379. Springer, Heidelberg (2009)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Gasc\u00f2n, A., Godoy, G., Schmidt-Schau\u00df, M.: Unification and matching on compressed terms. ACM TOCL\u00a012(4) (2011)","DOI":"10.1145\/1970398.1970402"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Kirchner, C.: Solving equations in abstract algebras: A rule-based survey of unification. In: Computational Logic - Essays in Honor of Alan Robinson, pp. 257\u2013321 (1991)","DOI":"10.1016\/0743-1066(92)90027-Z"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-25979-4_4","volume-title":"Rewriting Techniques and Applications","author":"J. Levy","year":"2004","unstructured":"Levy, J., Schmidt-Schau\u00df, M., Villaret, M.: Monadic Second-Order Unification Is NP-Complete. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 55\u201369. Springer, Heidelberg (2004)"},{"issue":"3","key":"32_CR7","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1137\/050645403","volume":"38","author":"J. Levy","year":"2008","unstructured":"Levy, J., Schmidt-Schau\u00df, M., Villaret, M.: The complexity of monadic second-order unification. SIAM J. Computation\u00a038(3), 1113\u20131140 (2008)","journal-title":"SIAM J. Computation"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-73437-6_24","volume-title":"Combinatorial Pattern Matching","author":"Y. Lifshits","year":"2007","unstructured":"Lifshits, Y.: Processing Compressed Texts: A Tractability Border. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 228\u2013240. Springer, Heidelberg (2007)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Marshall, A.M., Narendran, P.: New algorithms for unification modulo one-sided distributivity and its variants. Technical Report SUNYA-CS-12-02, University at Albany-SUNY (2012), \n                    \n                      http:\/\/www.cs.albany.edu\/~ncstrl\/treports\/Data\/README.html","DOI":"10.1007\/978-3-642-31365-3_32"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-63220-4_45","volume-title":"Combinatorial Pattern Matching","author":"M. Miyazaki","year":"1997","unstructured":"Miyazaki, M., Shinohara, A., Takeda, M.: An Improved Pattern Matching Algorithm for Strings in Terms of Straight-line Programs. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol.\u00a01264, pp. 1\u201311. Springer, Heidelberg (1997)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Narendran, P., Marshall, A.M., Mahapatra, B.: On the complexity of the Tiden-Arnborg algorithm for unification modulo one-sided distributivity. In: UNIF 24. EPTCS, vol.\u00a042, pp. 54\u201363 (2010)","DOI":"10.4204\/EPTCS.42.5"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms - ESA \u201994","author":"W. Plandowski","year":"1994","unstructured":"Plandowski, W.: Testing Equivalence of Morphisms on Context-free Languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 460\u2013470. Springer, Heidelberg (1994)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W. Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science\u00a0302, 211\u2013222 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1\/2","key":"32_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0747-7171(87)80026-3","volume":"3","author":"E. Tid\u00e9n","year":"1987","unstructured":"Tid\u00e9n, E., Arnborg, S.: Unification problems with one-sided distributivity. J. Symb. Comput.\u00a03(1\/2), 183\u2013202 (1987)","journal-title":"J. Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31365-3_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:58:27Z","timestamp":1620129507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31365-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642313646","9783642313653"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31365-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}