{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:40:52Z","timestamp":1725550852671},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008989"},{"type":"electronic","value":"9783540365778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36577-x_39","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:12:04Z","timestamp":1269882724000},"page":"537-552","source":"Crossref","is-referenced-by-count":3,"title":["Strategies for Combining Decision Procedures"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Conchon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sava","family":"Krsti\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"L. Bachmair, A. Tiwari, and L. Vigneron. Abstract congruence closure. Journal of Automated Reasoning, 2002. To appear.","DOI":"10.1023\/B:JARS.0000009518.26415.49"},{"key":"39_CR2","unstructured":"C. Barrett. Checking Validity of Quantifier-free formulas in Combinations of First-Order Theories. PhD thesis, Stanford University, 2002."},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"C. W. Barrett, D. L. Dill, and A. Stump. A generalization of Shostak\u2019s method for combining decision procedures. In Frontiers of Combining Systems (FROCOS), volume 2309 of Lecture Notes in Artificial Intelligence, pages 132\u2013147. Springer-Verlag, 2002.","DOI":"10.1007\/3-540-45988-X_11"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"S. Conchon and S. Krstic. Strategies for combining decision procedures. Technical Report CSE-03-001, OHSU, 2003.","DOI":"10.1007\/3-540-36577-X_39"},{"key":"39_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/3-540-44585-4_22","volume-title":"Proceedings of CAV\u20192001","author":"J.-C. Filliatre","year":"2001","unstructured":"J.-C. Filliatre, S. Owre, H. Rue\u03b2, and N. Shankar. ICS: Integrated Canonization and Solving (Tool presentation). In G. Berry, H. Comon, and A. Finkel, editors, Proceedings of CAV\u20192001, volume 2102 of Lecture Notes in Computer Science, pages 246\u2013249. Springer-Verlag, 2001."},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"H. Ganzinger. Shostak light. In A. Voronkov, editor, Automated Deduction-CADE-18, volume 2392 of Lecture Notes in Artificial Intelligence, pages 332\u2013347. Springer-Verlag, 2002.","DOI":"10.1007\/3-540-45620-1_28"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"D. Kapur. A rewrite rule based framework for combining decision procedures. In Frontiers of Combining Systems (FROCOS), volume 2309 of Lecture Notes in Artificial Intelligence, pages 87\u2013103. Springer-Verlag, 2002.","DOI":"10.1007\/3-540-45988-X_8"},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245\u2013257, 1979.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. JACM, 27(2):356\u2013364, 1980.","journal-title":"JACM"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Ch. Ringeissen. Cooperation of Decision Procedures for the Satisfiability Problem. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Applied Logic, pages 121\u2013140. Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-94-009-0349-4_6"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"H. Rue\u03b2 and N. Shankar. Deconstructing Shostak. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS-01), pages 19\u201328. IEEE Computer Society, 2001.","DOI":"10.1109\/LICS.2001.932479"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"N. Shankar. Little engines of proof. In L.-H. Eriksson and P. Lindsay, editors, FME 2002: Formal Methods-Getting IT Right, pages 1\u201320, Copenhagen, 2002. Springer-Verlag.","DOI":"10.1007\/3-540-45614-7_1"},{"key":"39_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45610-4_1","volume-title":"Rewriting Techniques and Applications (RTA)","author":"N. Shankar","year":"2002","unstructured":"N. Shankar and H. Rue\u03b2. Combining Shostak theories. In S. Tison, editor, Rewriting Techniques and Applications (RTA), volume 2378 of Lecture Notes in Computer Science, pages 1\u201319. Springer-Verlag, 2002."},{"issue":"1","key":"39_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2422.322411","volume":"31","author":"R. E. Shostak","year":"1984","unstructured":"R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1\u201312, 1984.","journal-title":"Journal of the ACM"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"A. Stump, C. Barrett, and D. Dill. CVC: a Cooperating Validity Checker. In 14th International Conference on Computer-Aided Verification, 2002.","DOI":"10.1007\/3-540-45657-0_40"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"C. Tinelli and M. T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Applied Logic, pages 103\u2013120. Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-94-009-0349-4_5"},{"key":"39_CR17","unstructured":"A. Tiwari. Decision Procedures in Automated Deduction. PhD thesis, University of Stony Brook, 2000."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36577-X_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T14:49:37Z","timestamp":1558968577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36577-X_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008989","9783540365778"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36577-x_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}