{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:49:30Z","timestamp":1725551370444},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662013"},{"type":"electronic","value":"9783540486855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48685-2_14","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:13:41Z","timestamp":1269897221000},"page":"175-189","source":"Crossref","is-referenced-by-count":5,"title":["Deciding the Word Problem in the Union of Equational Theories Sharing Constructors"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[]},{"given":"Cesare","family":"Tinelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,11,5]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. J. Symbolic Computation 21, 1996.","DOI":"10.1006\/jsco.1996.0009"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"F. Baader and C. Tinelli. A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method. In Proc. CADE-14, Springer LNAI 1249, 1997.","DOI":"10.1007\/3-540-63104-6_3"},{"key":"14_CR3","unstructured":"F. Baader and C. Tinelli. Deciding the word problem in the union of equational theories. UIUCDCS-Report 98-2073, Department of Computer Science, University of Illinois at Urbana-Champaign, 1998. Available at http:\/\/www-lti.informatik.rwth-aachen.de\/Forschung\/Papers.html ."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"A. Boudet. Combining unification algorithms. J. Symbolic Computation 16, 1993.","DOI":"10.1006\/jsco.1993.1066"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM 22, 1979.","DOI":"10.1145\/359138.359142"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"E. Domenjoud, F. Klay, and C. Ringeissen. Combination techniques for non-disjoint equational theories. In Proc. CADE-12, Springer LNAI 814, 1994.","DOI":"10.1007\/3-540-58156-1_19"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"H. Kirchner and Ch. Ringeissen. Combining symbolic constraint solvers on algebraic domains. J. Symbolic Computation 18, 1994.","DOI":"10.1006\/jsco.1994.1040"},{"key":"14_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Proc. RTA\u201989","author":"T. Nipkow","year":"1989","unstructured":"T. Nipkow. Combining matching algorithms: The regular case. In Proc. RTA\u201989, Springer LNCS 335, 1989."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"E. Ohlebusch. Modular properties of composable term rewriting systems. J. Symbolic Computation 20, 1995.","DOI":"10.1006\/jsco.1995.1036"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"D. Pigozzi. The join of equational theories. Colloquium Mathematicum 30, 1974.","DOI":"10.4064\/cm-30-1-15-25"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Ch. Ringeissen. Unification in a combination of equational theories with shared constants and its application to primal algebras. In Proc. LPAR\u201992, Springer LNAI 624, 1992.","DOI":"10.1007\/BFb0013067"},{"key":"14_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proc. STACS-11","author":"Ch. Ringeissen","year":"1994","unstructured":"Ch. Ringeissen. Combination of matching algorithms. In Proc. STACS-11, Springer LNCS 775, 1994."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"M. Schmidt-Schauff. Combination of unification algorithms. J. Symbolic Computation 8, 1989.","DOI":"10.1016\/S0747-7171(89)80037-9"},{"key":"14_CR14","volume-title":"First-Order Unification in Combinations of Equational Theories","author":"E. Tid\u00e9n","year":"1986","unstructured":"E. Tid\u00e9n. First-Order Unification in Combinations of Equational Theories. Phd thesis, The Royal Institute of Technology, Stockholm, 1986."},{"key":"14_CR15","unstructured":"C. Tinelli and Ch. Ringeissen. Non-disjoint unions of theories and combinations of satis\u00e0bility procedures: First results. Technical Report UIUCDCS-R-98-2044, Department of Computer Science, University of Illinois at Urbana-Champaign, April 1998. (Also available as INRIA research report no. RR-3402.)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48685-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:03:19Z","timestamp":1558983799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48685-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662013","9783540486855"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48685-2_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}