{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:53:42Z","timestamp":1648724022661},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3742,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s1571-0661(04)80650-9","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"22-34","source":"Crossref","is-referenced-by-count":8,"title":["Quantifier Elimination and Provers Integration"],"prefix":"10.1016","volume":"86","author":[{"given":"Silvio","family":"Ghilardi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Armando A., Ranise S., Rusinowitch M., Uniform Derivation of Superposition Based Decision Procedures, \u201cProceedings of the Annual Conference on Computer Science Logic\u201d (CSL01), Paris, France, pp. 513\u2013527, (2001).","DOI":"10.1007\/3-540-44802-0_36"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Baader F., Tinelli C., Combining Decision Procedures for Positive Theories Sharing Constructors, in Sophie Tison (ed.) \u201cRewriting Techniques and Applications\u201d, 13th International Conference (RTA02), Springer LNCS 2378, pp. 352\u2013366, (2002).","DOI":"10.1007\/3-540-45610-4_25"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB3","series-title":"\u201cAutomated Deduction - A Basis for Applications\u201d, vol. I","first-page":"353","article-title":"Equational Reasoning in Saturation-Based Theorem Proving","author":"Bachmair","year":"1998"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB4","series-title":"Model Theory","author":"Chang","year":"1990"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Ferrante J., Rackoff C.W., The Computational Complexity of Logical Theories, Springer Lecture Notes in Mathematics 718, (1979).","DOI":"10.1007\/BFb0062837"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB6","unstructured":"Ghilardi S., Reasoners Cooperation and Quantifier Elimination, Rapporto Interno n. 288\u201303, Dipartimento di Scienze dell'Informazione, Universit\u00e0 degli Studi di Milano (2003)."},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Ghilardi S., Santocanale L., Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logic, preprint (2003).","DOI":"10.1007\/978-3-540-39813-4_10"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB8","series-title":"Trends in Logic Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-9936-8_3","article-title":"Sheaves, Games and Model Completions","author":"Ghilardi","year":"2002"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1015707001763","article-title":"A General Setting for Flexibly Combining and Augmenting Decision Procedures","volume":"28","author":"Janicic\u0300","year":"2002","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB10","series-title":"\u201cHandbook of Mathematical Logic\u201d","first-page":"139","article-title":"Model Completeness","author":"MacIntyre","year":"1977"},{"issue":"2","key":"10.1016\/S1571-0661(04)80650-9_NEWBIB11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/357073.357079","article-title":"Simplification by Cooperating Decision Procedures","volume":"1","author":"Nelson","year":"1979","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB12","series-title":"\u201cHandbook of Automated Reasoning\u201d, vol. I","first-page":"371","article-title":"Paramodulation-Based Theorem Proving","author":"Nieuwhenhuis","year":"2001"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(80)90059-6","article-title":"Complexity, Convexity and Combination of Theories","volume":"12","author":"Oppen","year":"1980","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/S1571-0661(04)80650-9_NEWBIB14","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/322203.322204","article-title":"Reasoning about Recursively Defined Data Structures","volume":"27","author":"Oppen","year":"1980","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB15","doi-asserted-by":"crossref","DOI":"10.1023\/A:1022587501759","article-title":"Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing","author":"Tinelli","year":"2003","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB16","series-title":"\u201c1st International Workshop on Frontiers of Combining Systems (FroCos'96)\u201d, Applied Logic Series, vol. 3","first-page":"103","article-title":"A New Correctness Proof of the Nelson-Oppen Combination Procedure","author":"Tinelli","year":"1996"},{"issue":"1","key":"10.1016\/S1571-0661(04)80650-9_NEWBIB17","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0304-3975(01)00332-2","article-title":"Unions of Non-Disjoint Theories and Combination of Satisfiability Procedures","volume":"290","author":"Tinelli","year":"2003","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02757007","article-title":"Model-Companions and Definability in Existentially Complete Structures","volume":"25","author":"Wheeler","year":"1976","journal-title":"Israel Journal of Mathematics"},{"key":"10.1016\/S1571-0661(04)80650-9_NEWBIB19","series-title":"\u201cAdvances in Modal Logic\u201d","article-title":"Fusions of Modal Logics Revisited","author":"Wolter","year":"1998"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806509?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806509?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:14:14Z","timestamp":1585898054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S1571066104806509"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80650-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}