{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:27:41Z","timestamp":1725488861012},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439165"},{"type":"electronic","value":"9783540456100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45610-4_25","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T06:47:11Z","timestamp":1186901231000},"page":"352-366","source":"Crossref","is-referenced-by-count":7,"title":["Combining Decision Procedures for Positive 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":[[2002,7,9]]},"reference":[{"key":"25_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CADE-11","author":"F. Baader","year":"1992","unstructured":"F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In Proc. CADE-11, Springer LNCS 607, 1992."},{"key":"25_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proc. RTA\u201995","author":"F. Baader","year":"1995","unstructured":"F. Baader and K.U. Schulz. Combination of constraint solving techniques: An algebraic point of view. In Proc. RTA\u201995, Springer LNCS 914, 1995."},{"key":"25_CR3","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":"25_CR4","doi-asserted-by":"crossref","unstructured":"F. Baader and C. Tinelli. Combining decision procedures for positive theories sharing constructors. Technical report no. 02-02, Dept. of Computer Science, University of Iowa, 2002 (available at http:\/\/cs.uiowa.edu\/~tinelli\/papers.html ).","DOI":"10.1007\/3-540-45610-4_25"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"F. Baader and C. Tinelli. Deciding the word problem in the union of equational theories. Information and Computation, 2002. To appear (preprint available at http:\/\/cs.uiowa.edu\/~tinelli\/papers.html ).","DOI":"10.1006\/inco.2001.3118"},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CADE-12","author":"E. Domenjoud","year":"1994","unstructured":"E. Domenjoud, F. Klay, and Ch. Ringeissen. Combination techniques for non-disjoint equational theories. In Proc. CADE-12, Springer LNCS 814, 1994."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"W. Hodges. Model Theory, Cambridge University Press, 1993.","DOI":"10.1017\/CBO9780511551574"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"G. Nelson and D.C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Programming Languages and Systems 1, 1979.","DOI":"10.1145\/357073.357079"},{"key":"25_CR9","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":"25_CR10","unstructured":"Ch. Ringeissen. Personal communication, 2001."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"M. Schmidt-Schau\u00df. Unification in a combination of arbitrary disjoint equational theories. J. Symbolic Computation 8, 1989.","DOI":"10.1016\/S0747-7171(89)80037-9"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"M. E. Stickel. A unification algorithm for associative commutative functions. J. ACM 28, 1981.","DOI":"10.1145\/322261.322262"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"C. Tinelli and Ch. Ringeissen. Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science, 2002. To appear (preprint available at http:\/\/cs.uiowa.edu\/~tinelli\/papers.html ).","DOI":"10.1016\/S0304-3975(01)00332-2"}],"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-45610-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:54:17Z","timestamp":1556754857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45610-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439165","9783540456100"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45610-4_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}