{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:15Z","timestamp":1725486255498},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433811"},{"type":"electronic","value":"9783540459880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45988-x_9","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:19:02Z","timestamp":1181182742000},"page":"103-116","source":"Crossref","is-referenced-by-count":16,"title":["Combining Sets with Integers"],"prefix":"10.1007","author":[{"given":"Calogero G.","family":"Zarba","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"9_CR1","unstructured":"Domenico Cantone and Vincenzo Cutello. A decision procedure for set-theoretic formulae involving rank and cardinality comparison. In A. Bertoni, C. B\u00f6hm,and P. Miglioli,eds., Proceedings of the 3rd Italian Conference on Theoretical Computer Science,pages 150\u2013163. World Scientific,1989."},{"key":"9_CR2","series-title":"Lect Notes Comput Sci","first-page":"95","volume-title":"Proceedings of the fourth Computer Science Logic Workshop","author":"D. Cantone","year":"1990","unstructured":"Domenico Cantone, Vincenzo Cutello, and Jacob T. Schwartz. Decision problems for Tarski\u2019s and Presburger arithmetics extended with sets. In Proceedings of the fourth Computer Science Logic Workshop, volume 533 of Lecture Notes in Computer Science,pages 95\u2013109. Springer,1990."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Domenico Cantone and Calogero G. Zarba. A tableau calculus for integrating firstorder reasoning with elementary set theory reasoning. In Roy Dyckhoff, ed., Automated Reasoning with Analytic Tableaux and Related Methods, volume 1847 of Lecture Notes in Artificial Intelligence, pages 143\u2013159. Springer,2000.","DOI":"10.1007\/10722086_14"},{"issue":"5","key":"9_CR4","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1002\/cpa.3160330503","volume":"33","author":"A. Ferro","year":"1980","unstructured":"Alfredo Ferro, Eugenio G. Omodeo, and Jacob T. Scwhartz. Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions. Communications on Pure and Applied Mathematics, 33(5):599\u2013608, 1980.","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Greg Nelson and Derek 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"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Cesare Tinelli and Mehdi T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In Franz Baader and Klaus U. Schulz,eds., Frontiers of Combining Systems, volume 3 of Applied Logic Series,pages 103\u2013120. Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-94-009-0349-4_5"},{"issue":"59","key":"9_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/14786448008626877","volume":"9","author":"J. Venn","year":"1880","unstructured":"John Venn. On the diagrammatic and mechanical representation of propositions and reasonings. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 9(59):1\u201318, 1880.","journal-title":"The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science"},{"key":"9_CR8","unstructured":"Calogero G. Zarba. Combining lists with integers. In Rajeev Gor\u00e8, Alexander Leitsch, and Tobias Nipkow, eds., International Joint Conference on Automated Reasoning (Short Papers), Technical Report DII 11\/01, pages 170\u2013179. University of Siena, Italy, 2001."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45988-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:43:42Z","timestamp":1556480622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45988-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433811","9783540459880"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45988-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}