{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:01:02Z","timestamp":1760061662012},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319242453"},{"type":"electronic","value":"9783319242460"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24246-0_5","type":"book-chapter","created":{"date-parts":[[2015,9,19]],"date-time":"2015-09-19T04:20:53Z","timestamp":1442636453000},"page":"69-84","source":"Crossref","is-referenced-by-count":16,"title":["NRCL - A Model Building Approach to\u00a0the Bernays-Sch\u00f6nfinkel Fragment"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Alagi","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Weidenbach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"5_CR1","unstructured":"Alagi, G., Weidenbach, C.: NRCL - A Model Building Approach to the Bernays-Sch\u00f6nfinkel Fragment (Full Paper). CoRR, abs\/1502.05501 (2015). http:\/\/arxiv.org\/abs\/1502.05501"},{"key":"5_CR2","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Automated Reasoning","year":"2008","unstructured":"Armando, A., Baumgartner, P., Dowek, G. (eds.): IJCAR 2008. LNCS (LNAI), vol.\u00a05195. Springer, Heidelberg (2008)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson and Voronkov (eds.) [23], pp. 19\u201399","DOI":"10.1016\/B978-044450813-3\/50004-7"},{"key":"5_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","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.\u00a04246, pp. 572\u2013586. Springer, Heidelberg (2006)"},{"key":"5_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/978-3-540-45085-6_32","volume-title":"Automated Deduction \u2013 CADE-19","author":"P. Baumgartner","year":"2003","unstructured":"Baumgartner, P., Tinelli, C.: The model evolution calculus. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 350\u2013364. Springer, Heidelberg (2003)"},{"key":"5_CR6","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press (2009)"},{"key":"5_CR7","unstructured":"Bonacina, M.P., Plaisted, D.A.: SGGS theorem proving: an exposition. In: Notes of the Fourth Workshop on Practical Aspects in Automated Reasoning (PAAR) (2014)"},{"key":"5_CR8","unstructured":"Claessen, K., Srensson, N.: New Techniques that Improve MACE-style finite model finding. In: Model Computation - Principles, Algorithms, Applications (2003)"},{"key":"5_CR9","unstructured":"Comon, H.: Disunification: A survey. In: Computational Logic - Essays in Honor of Alan Robinson, pp. 322\u2013359 (1991)"},{"issue":"1\u20132","key":"5_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10472-009-9150-9","volume":"55","author":"A. Fietzke","year":"2009","unstructured":"Fietzke, A., Weidenbach, C.: Labelled splitting. Ann. Math. Artif. Intell.\u00a055(1\u20132), 3\u201334 (2009)","journal-title":"Ann. Math. Artif. Intell."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: LICS, pp. 55\u201364. IEEE Computer Society (2003)","DOI":"10.1109\/LICS.2003.1210045"},{"issue":"1","key":"5_CR12","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by Divisibility in Abstract Algebras. Proceedings of the London Mathematical Society\u00a02(1), 326\u2013336 (1952)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, vol.\u00a07788, pp. 68\u2013100. Springer, Heidelberg (2013)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Korovin, K.: iProver - An instantiation-based theorem prover for first-order logic (system description). In: Armando et al. [2], pp. 292\u2013298","DOI":"10.1007\/978-3-540-71070-7_24"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a07797, pp. 239\u2013270. Springer, Heidelberg (2013)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, vol.\u00a08152, pp. 214\u2013228. Springer, Heidelberg (2013)"},{"issue":"3","key":"5_CR17","first-page":"301","volume":"3","author":"J.-L. Lassez","year":"1987","unstructured":"Lassez, J.-L., Marriott, K.: Explicit Representation of Terms Defined by Counter Examples. J. Autom. Reasoning\u00a03(3), 301\u2013317 (1987)","journal-title":"J. Autom. Reasoning"},{"issue":"3","key":"5_CR18","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0022-0000(80)90027-6","volume":"21","author":"H.R. Lewis","year":"1980","unstructured":"Lewis, H.R.: Complexity Results for Classes of Quantificational Formulas. J. Comput. Syst. Sci.\u00a021(3), 317\u2013353 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-540-32275-7_3","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Nieuwenhuis","year":"2005","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and abstract DPLL nodulo theories. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 36\u201350. Springer, Heidelberg (2005)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson and Voronkov [23], pp. 371\u2013443","DOI":"10.1016\/B978-044450813-3\/50009-6"},{"key":"5_CR21","unstructured":"P\u00e9rez, J.A.N., Voronkov, A.: Proof Systems for Effectively Propositional Logic. In: Armando et al. [21], pp. 426\u2013440"},{"issue":"4","key":"5_CR22","doi-asserted-by":"crossref","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. Reasoning\u00a044(4), 401\u2013424 (2010)","journal-title":"J. Autom. Reasoning"},{"key":"5_CR23","unstructured":"Robinson, J.A., Voronkov, A. (eds.): Handbook of Automated Reasoning, vol. 2. Elsevier and MIT Press (2001)"},{"key":"5_CR24","unstructured":"Silva, J.P.M., Sakallah, K.A.: Conflict analysis in search algorithms for satisfiability. In: ICTAI, pp. 467\u2013469 (1996)"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/978-3-642-14203-1_38","volume-title":"Automated Reasoning","author":"M. Suda","year":"2010","unstructured":"Suda, M., Weidenbach, C., Wischnewski, P.: On the saturation of YAGO. In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS, vol.\u00a06173, pp. 441\u2013456. Springer, Heidelberg (2010)"},{"key":"5_CR26","unstructured":"Tammet, T.: Finite model building: improvements and comparisons. In: Model Computation: Principles, Algorithms, Applications (2003)"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson and Voronkov [23], pp. 1965\u20132013","DOI":"10.1016\/B978-044450813-3\/50029-1"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24246-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T19:24:50Z","timestamp":1567193090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24246-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319242453","9783319242460"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24246-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}