{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:12:27Z","timestamp":1753888347952,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030294359"},{"type":"electronic","value":"9783030294366"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29436-6_14","type":"book-chapter","created":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T16:04:02Z","timestamp":1566317042000},"page":"233-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["SCL Clause Learning from Simple Models"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Fiori","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Weidenbach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,20]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-24246-0_5","volume-title":"Frontiers of Combining Systems","author":"G Alagi","year":"2015","unstructured":"Alagi, G., Weidenbach, C.: NRCL - a model building approach to the Bernays-Sch\u00f6nfinkel fragment. In: Lutz, C., Ranise, S. (eds.) FroCoS 2015. LNCS (LNAI), vol. 9322, pp. 69\u201384. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24246-0_5"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-69778-0_14","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"P Baumgartner","year":"1998","unstructured":"Baumgartner, P.: Hyper tableau\u2014the next generation. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 60\u201376. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69778-0_14"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/11916277_39","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"P Baumgartner","year":"2006","unstructured":"Baumgartner, P., Fuchs, A., Tinelli, C.: Lemma learning in the model evolution calculus. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 572\u2013586. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11916277_39"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10817-015-9334-4","volume":"56","author":"MP Bonacina","year":"2016","unstructured":"Bonacina, M.P., Plaisted, D.A.: Semantically-guided goal-sensitive reasoning: model representation. J. Autom. Reason. 56(2), 113\u2013141 (2016)","journal-title":"J. Autom. Reason."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-319-21401-6_42","volume-title":"Automated Deduction \u2013 CADE-25","author":"M Bromberger","year":"2015","unstructured":"Bromberger, M., Sturm, T., Weidenbach, C.: Linear integer arithmetic revisited. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 623\u2013637. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21401-6_42"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1093\/logcom\/exm008","volume":"17","author":"CG Ferm\u00fcller","year":"2007","unstructured":"Ferm\u00fcller, C.G., Pichler, R.: Model representation over finite and infinite signatures. J. Log. Comput. 17(3), 453\u2013477 (2007)","journal-title":"J. Log. Comput."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-36675-8_4","volume-title":"Automated Reasoning and Mathematics","author":"T Hillenbrand","year":"2013","unstructured":"Hillenbrand, T., Weidenbach, C.: Superposition for bounded domains. In: Bonacina, M.P., Stickel, M.E. (eds.) Automated Reasoning and Mathematics. LNCS (LNAI), vol. 7788, pp. 68\u2013100. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36675-8_4"},{"issue":"3","key":"14_CR8","first-page":"25","volume":"37","author":"B Kaufmann","year":"2016","unstructured":"Kaufmann, B., Leone, N., Perri, S., Schaub, T.: Grounding and solving in answer set programming. AI Mag. 37(3), 25\u201332 (2016)","journal-title":"AI Mag."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-37651-1_10","volume-title":"Programming Logics","author":"K Korovin","year":"2013","unstructured":"Korovin, K.: Inst-Gen \u2013 a modular approach to instantiation-based automated reasoning. In: Voronkov, A., Weidenbach, C. (eds.) Programming Logics. LNCS, vol. 7797, pp. 239\u2013270. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37651-1_10"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-40885-4_15","volume-title":"Frontiers of Combining Systems","author":"K Korovin","year":"2013","unstructured":"Korovin, K.: Non-cyclic sorts for first-order satisfiability. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS (LNAI), vol. 8152, pp. 214\u2013228. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40885-4_15"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0022-0000(80)90027-6","volume":"21","author":"HR Lewis","year":"1980","unstructured":"Lewis, H.R.: Complexity results for classes of quantificational formulas. J. Comput. Syst. Sci. 21(3), 317\u2013353 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving sat and sat modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL (T). J. ACM 53, 937\u2013977 (2006)","journal-title":"J. ACM"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-71070-7_36","volume-title":"Automated Reasoning","author":"JA Navarro","year":"2008","unstructured":"Navarro, J.A., Voronkov, A.: Proof systems for effectively propositional logic. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 426\u2013440. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71070-7_36"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10817-009-9161-6","volume":"44","author":"R Piskac","year":"2010","unstructured":"Piskac, R., de Moura, L.M., Bj\u00f8rner, N.: Deciding effectively propositional logic using DPLL and substitution sets. J. Autom. Reason. 44(4), 401\u2013424 (2010)","journal-title":"J. Autom. Reason."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0022-0000(84)90010-2","volume":"29","author":"DA Plaisted","year":"1984","unstructured":"Plaisted, D.A.: Complete problems in the first-order predicate calculus. J. Comput. Syst. Sci. 29, 8\u201335 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"14_CR16","first-page":"99","volume":"37","author":"G Sutcliffe","year":"2016","unstructured":"Sutcliffe, G.: The CADE ATP system competition - CASC. AI Mag. 37(2), 99\u2013101 (2016)","journal-title":"AI Mag."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-24246-0_6","volume-title":"Frontiers of Combining Systems","author":"A Teucke","year":"2015","unstructured":"Teucke, A., Weidenbach, C.: First-order logic theorem proving and model building via approximation and instantiation. In: Lutz, C., Ranise, S. (eds.) FroCoS 2015. LNCS (LNAI), vol. 9322, pp. 85\u2013100. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24246-0_6"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE 27"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29436-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T21:55:08Z","timestamp":1657576508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29436-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030294359","9783030294366"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29436-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CADE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Deduction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Natal","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cade2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.mat.ufrn.br\/CADE-27\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}