{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:56:40Z","timestamp":1775840200394,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540232421","type":"print"},{"value":"9783540302278","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30227-8_53","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T21:34:52Z","timestamp":1284845692000},"page":"641-653","source":"Crossref","is-referenced-by-count":35,"title":["Combining Decision Procedures for Sorted Theories"],"prefix":"10.1007","author":[{"given":"Cesare","family":"Tinelli","sequence":"first","affiliation":[]},{"given":"Calogero G.","family":"Zarba","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","unstructured":"Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: A theorem prover for program checking. Technical Report HPL-2\u20133-148, HP Laboratories, Palo Alto, CA (2003)"},{"key":"53_CR2","unstructured":"Ganesh, V., Berezin, S., Tinelli, C., Dill, D.: Combination results for many sorted theories with overlapping signatures. Technical report, Department of Computer Science, Stanford University (2004)"},{"key":"53_CR3","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"First Order Theorem Proving","author":"S. Ghilardi","year":"2003","unstructured":"Ghilardi, S.: Quantifier elimination and provers integration. In: Dahn, I., Vigneron, L. (eds.) First Order Theorem Proving. Electronic Notes in Theoretical Computer Science, vol.\u00a086.1, Elsevier, Amsterdam (2003)"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Ghilardi, S.: Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning (2004) (to appear)","DOI":"10.1007\/s10817-004-6241-5"},{"issue":"2","key":"53_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J.A. Goguen","year":"1992","unstructured":"Goguen, J.A., Meseguer, J.: Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science\u00a0105(2), 173\u2013217 (1992)","journal-title":"Theoretical Computer Science"},{"key":"53_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"International Joint Conference on Automated Reasoning","author":"F. Maric","year":"2004","unstructured":"Maric, F., Jani\u010di\u0107, P.: ARGO-LIB: A generic platform for decision procedures. In: International Joint Conference on Automated Reasoning. LNCS, Springer, Heidelberg (2004)"},{"key":"53_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J. Meseguer","year":"1998","unstructured":"Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol.\u00a01376, pp. 18\u201361. Springer, Heidelberg (1998)"},{"issue":"2","key":"53_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"53_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-45657-0_40","volume-title":"Computer Aided Verification","author":"A. Stump","year":"2002","unstructured":"Stump, A., Barrett, C.W., Dill, D.L.: CVC: A cooperating validity checker. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 500\u2013504. Springer, Heidelberg (2002)"},{"issue":"1","key":"53_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1022587501759","volume":"30","author":"C. Tinelli","year":"2003","unstructured":"Tinelli, C.: Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning\u00a030(1), 1\u201331 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"53_CR11","series-title":"Applied Logic Series","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-94-009-0349-4_5","volume-title":"Frontiers of Combining Systems","author":"C. Tinelli","year":"1996","unstructured":"Tinelli, C., Harandi, M.T.: A new correctness proof of the Nelson-Oppen combination procedure. In: Baader, F., Schulz, K.U. (eds.) Frontiers of Combining Systems. Applied Logic Series, vol.\u00a03, pp. 103\u2013120. Kluwer, Dordrecht (1996)"},{"issue":"1","key":"53_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(01)00332-2","volume":"290","author":"C. Tinelli","year":"2003","unstructured":"Tinelli, C., Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science\u00a0290(1), 291\u2013353 (2003)","journal-title":"Theoretical Computer Science"},{"key":"53_CR13","doi-asserted-by":"crossref","unstructured":"Tinelli, C., Zarba, C.G.: Combining decision procedures for sorted theories. Technical Report 04-01, The University of Iowa (2004)","DOI":"10.1007\/978-3-540-30227-8_53"},{"key":"53_CR14","unstructured":"Zarba, C.G.: C-tableaux. Technical Report RR-5229, INRIA (2004)"},{"key":"53_CR15","unstructured":"Zarba, C.G.: The Combination Problem in Automated Reasoning. PhD thesis, Stanford University (2004)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30227-8_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:51:00Z","timestamp":1605743460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30227-8_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232421","9783540302278"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30227-8_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}