{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T14:20:56Z","timestamp":1763389256292},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030221010"},{"type":"electronic","value":"9783030221027"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22102-7_23","type":"book-chapter","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T08:21:26Z","timestamp":1561450886000},"page":"497-522","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Asymmetric Unification and Disunification"],"prefix":"10.1007","author":[{"given":"Veena","family":"Ravishankar","sequence":"first","affiliation":[]},{"given":"Kimberly A.","family":"Cornell","sequence":"additional","affiliation":[]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,1]]},"reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"23_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/S0747-7171(89)80055-0","volume":"8","author":"F Baader","year":"1989","unstructured":"Baader, F.: Unification in commutative theories. J. Symb. Comput. 8(5), 479\u2013497 (1989)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1145\/174130.174133","volume":"40","author":"F Baader","year":"1993","unstructured":"Baader, F.: Unification in commutative theories, Hilbert\u2019s basis theorem, and Gr\u00f6bner bases. J. ACM 40(3), 477\u2013503 (1993)","journal-title":"J. ACM"},{"key":"23_CR4","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1999","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1999)"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF01195536","volume":"7","author":"F Baader","year":"1996","unstructured":"Baader, F., Nutt, W.: Combination problems for commutative\/monoidal theories or how algebra can help in equational unification. Appl. Algebra Eng. Commun. Comput. 7(4), 309\u2013337 (1996)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0304-3975(94)00277-0","volume":"142","author":"F Baader","year":"1995","unstructured":"Baader, F., Schulz, K.U.: Combination techniques and decision problems for disunification. Theor. Comput. Sci. 142(2), 229\u2013255 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/B978-044450813-3\/50010-2","volume-title":"Handbook of Automated Reasoning","author":"Franz Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Handbook of Automated Reasoning, vol. 1, pp. 445\u2013532 (2001)"},{"key":"23_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-7118-2","volume-title":"Canonical Equational Proofs","author":"L Bachmair","year":"1991","unstructured":"Bachmair, L.: Canonical Equational Proofs. Birkhauser, Boston (1991)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Mertens, M.C., Paar, C., Pelzl, J., Rupp, A.: A parallel hardware architecture for fast Gaussian elimination over GF(2). In: 14th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2006), Napa, CA, USA, 24\u201326 April 2006, Proceedings, pp. 237\u2013248. IEEE Computer Society (2006)","DOI":"10.1109\/FCCM.2006.12"},{"key":"23_CR10","unstructured":"Brahmakshatriya, S., Danturi, S., Gero, K.A., Narendran, P.: Unification problems modulo a theory of until. In: Korovin, K., Morawska, B. (eds.) 27th International Workshop on Unification, UNIF 2013, Eindhoven, Netherlands, 26 June 2013. EPiC Series in Computing, vol. 19, pp. 22\u201329. EasyChair (2013). \n                    http:\/\/www.easychair.org\/publications\/?page=723757558"},{"issue":"1\u20136","key":"23_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Math. Logic Q. 6(1\u20136), 66\u201392 (1960)","journal-title":"Math. Logic Q."},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/179812.179813","volume":"41","author":"WL Buntine","year":"1994","unstructured":"Buntine, W.L., B\u00fcrckert, H.-J.: On solving equations and disequations. J. ACM 41(4), 591\u2013629 (1994)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"23_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0747-7171(89)80021-5","volume":"8","author":"H-J B\u00fcrckert","year":"1989","unstructured":"B\u00fcrckert, H.-J., Herold, A., Schmidt-Schauss, M.: On equational theories, unification, and (un)decidability. J. Symb. Comput. 8(1\u20132), 3\u201349 (1989)","journal-title":"J. Symb. Comput."},{"key":"23_CR14","unstructured":"Comon, H.: Disunification: a survey. In: Lassez, J.-L., Plotkin, G.D. (eds.) Computational Logic - Essays in Honor of Alan Robinson, pp. 322\u2013359. The MIT Press (1991)"},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"CC Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soc. 98(1), 21\u201351 (1961)","journal-title":"Trans. Am. Math. Soc."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-38574-2_16","volume-title":"Automated Deduction \u2013 CADE-24","author":"S Erbatur","year":"2013","unstructured":"Erbatur, S., et al.: Asymmetric unification: a new unification paradigm for cryptographic protocol analysis. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 231\u2013248. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38574-2_16"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-54830-7_18","volume-title":"Foundations of Software Science and Computation Structures","author":"S Erbatur","year":"2014","unstructured":"Erbatur, S., Kapur, D., Marshall, A.M., Meadows, C., Narendran, P., Ringeissen, C.: On asymmetric unification and the combination problem in disjoint theories. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol. 8412, pp. 274\u2013288. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-642-54830-7_18"},{"key":"23_CR18","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. W. H. Freeman & Co., New York (1979)"},{"issue":"1","key":"23_CR19","first-page":"49","volume":"55","author":"RN Greenwell","year":"2009","unstructured":"Greenwell, R.N., Kertzner, S.: Solving linear diophantine matrix equations using the Smith normal form (more or less). Int. J. Pure Appl. Math. 55(1), 49\u201360 (2009)","journal-title":"Int. J. Pure Appl. Math."},{"issue":"1\u20132","key":"23_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/inco.1999.2849","volume":"162","author":"Q Guo","year":"2000","unstructured":"Guo, Q., Narendran, P., Wolfram, D.A.: Complexity of nilpotent unification and matching problems. Inf. Comput. 162(1\u20132), 3\u201323 (2000)","journal-title":"Inf. Comput."},{"key":"23_CR21","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"},{"issue":"4","key":"23_CR22","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/0608057","volume":"8","author":"E Kaltofen","year":"1987","unstructured":"Kaltofen, E., Krishnamoorthy, M.S., Saunders, B.D.: Fast parallel computation of Hermite and Smith forms of polynomial matrices. SIAM J. Algebraic Discrete Methods 8(4), 683\u2013690 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(85)90131-8","volume":"39","author":"R Kannan","year":"1985","unstructured":"Kannan, R.: Solving systems of linear equations over polynomials. Theor. Comput. Sci. 39, 69\u201388 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Klaedtke, F., Ruess, H.: Parikh automata and monadic second-order logics with linear cardinality constraints (2002)","DOI":"10.1007\/3-540-45061-0_54"},{"issue":"1","key":"23_CR25","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/0743-7315(91)90115-P","volume":"13","author":"\u00c7K Ko\u00e7","year":"1991","unstructured":"Ko\u00e7, \u00c7.K., Arachchige, S.N.: A fast algorithm for Gaussian elimination over GF(2) and its implementation on the GAPP. J. Parallel Distrib. Comput. 13(1), 118\u2013122 (1991)","journal-title":"J. Parallel Distrib. Comput."},{"key":"23_CR26","unstructured":"Liu, Z.: Dealing efficiently with exclusive-OR, abelian groups and homomorphism in cryptographic protocol analysis. Ph.D. thesis, Clarkson University (2012)"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-45620-1_37","volume-title":"Automated Deduction\u2014CADE-18","author":"C Lynch","year":"2002","unstructured":"Lynch, C., Morawska, B.: Basic syntactic mutation. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 471\u2013485. Springer, Heidelberg (2002). \n                    https:\/\/doi.org\/10.1007\/3-540-45620-1_37"},{"key":"23_CR28","volume-title":"The Theory of Matrices","author":"CC MacDuffee","year":"1961","unstructured":"MacDuffee, C.C.: The Theory of Matrices. Chelsea Publishing Company, New York (1961)"},{"key":"23_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/3-540-52885-7_118","volume-title":"10th International Conference on Automated Deduction","author":"W Nutt","year":"1990","unstructured":"Nutt, W.: Unification in monoidal theories. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 618\u2013632. Springer, Heidelberg (1990). \n                    https:\/\/doi.org\/10.1007\/3-540-52885-7_118"},{"key":"23_CR30","unstructured":"Rotman, J.J.: Advanced Modern Algebra. Prentice Hall. 1st edn (2002); 2nd printing (2003)"},{"key":"23_CR31","first-page":"629","volume":"2","author":"MY Vardi","year":"2008","unstructured":"Vardi, M.Y., Wilke, T.: Automata: from logics to algorithms. Logic Automata 2, 629\u2013736 (2008)","journal-title":"Logic Automata"}],"container-title":["Lecture Notes in Computer Science","Description Logic, Theory Combination, and All That"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22102-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T08:26:05Z","timestamp":1561451165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-22102-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030221010","9783030221027"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22102-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}