{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:36:53Z","timestamp":1754109413500},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_30","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"332-344","source":"Crossref","is-referenced-by-count":12,"title":["The Complexity of Equivariant Unification"],"prefix":"10.1007","author":[{"given":"James","family":"Cheney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.4153\/CJM-1994-064-8","volume":"46","author":"M.H. Albert","year":"1994","unstructured":"Albert, M.H., Lawrence, J.: Unification in varieties of groups: nilpotent varieties. Canadian Journal of Mathematics\u00a046(6), 1135\u20131149 (1994)","journal-title":"Canadian Journal of Mathematics"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-27775-0_19","volume-title":"Logic Programming","author":"J. Cheney","year":"2004","unstructured":"Cheney, J., Urban, C.: Alpha-Prolog: A logic programming language with names, binding and alpha-equivalence. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 269\u2013283. Springer, Heidelberg (2004) (to appear)"},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(03)00401-8","volume":"312","author":"L. Engebretsen","year":"2004","unstructured":"Engebretsen, L., Holmerin, J., Russell, A.: Inapproximability results for equations over finite groups. Theoretical Computer Science\u00a0312(1), 17\u201345 (2004)","journal-title":"Theoretical Computer Science"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, M., Gabbay, M., Mackie, I.: Nominal rewriting (January 2004) (submitted)","DOI":"10.1145\/1013963.1013978"},{"issue":"3","key":"30_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02018086","volume":"9","author":"H. Finkelstein","year":"1978","unstructured":"Finkelstein, H.: Solving equations in groups: a survey of Frobenius\u2019 Theorem. Periodica Mathematica Hungarica\u00a09(3), 187\u2013204 (1978)","journal-title":"Periodica Mathematica Hungarica"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M.J. Gabbay","year":"2002","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013, 341\u2013363 (2002)","journal-title":"Formal Aspects of Computing"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0890-5401(02)93173-1","volume":"178","author":"M. Goldmann","year":"2002","unstructured":"Goldmann, M., Russell, A.: The complexity of solving equations over finite groups. Information and Computation\u00a0178, 253\u2013262 (2002)","journal-title":"Information and Computation"},{"key":"30_CR8","first-page":"204","volume-title":"Proc. 14th Symp. on Logic in Computer Science","author":"M. Hofmann","year":"1999","unstructured":"Hofmann, M.: Semantical analysis of higher-order abstract syntax. In: Proc. 14th Symp. on Logic in Computer Science, July 1999, pp. 204\u2013213. IEEE, Los Alamitos (1999)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"Huet, G.: A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science\u00a01, 27\u201367 (1975)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. Transactions on Programming Languages and Systems\u00a04(2), 258\u2013282 (1982)","journal-title":"Transactions on Programming Languages and Systems"},{"issue":"4","key":"30_CR11","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation\u00a01(4), 497\u2013536 (1991)","journal-title":"J. Logic and Computation"},{"key":"30_CR12","first-page":"199","volume-title":"Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI 1989)","author":"F. Pfenning","year":"1989","unstructured":"Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI 1989), pp. 199\u2013208. ACM Press, New York (1989)"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"183","author":"A.M. Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and Computation\u00a0183, 165\u2013193 (2003)","journal-title":"Information and Computation"},{"issue":"1","key":"30_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM\u00a012(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Urban, C., Cheney, J.: Avoiding equivariance in Alpha-Prolog (2004) (submitted)","DOI":"10.1007\/11417170_29"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-540-45220-1_41","volume-title":"Computer Science Logic","author":"C. Urban","year":"2003","unstructured":"Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 513\u2013527. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:23:54Z","timestamp":1605759834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}