{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:33:24Z","timestamp":1725471204649},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540371878"},{"type":"electronic","value":"9783540371885"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814771_11","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T15:44:21Z","timestamp":1160063061000},"page":"125-139","source":"Crossref","is-referenced-by-count":21,"title":["Blocking and Other Enhancements for Bottom-Up Model Generation Methods"],"prefix":"10.1007","author":[{"given":"Peter","family":"Baumgartner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renate A.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013882326814","volume":"69","author":"F. Baader","year":"2001","unstructured":"Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica\u00a069, 5\u201340 (2001)","journal-title":"Studia Logica"},{"key":"11_CR2","unstructured":"Baumgartner, P., Fuchs, A., Tinelli, C.: DARWIN, http:\/\/goedel.cs.uiowa.edu\/Darwin\/"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Logics in Artificial Intelligence","author":"P. Baumgartner","year":"1996","unstructured":"Baumgartner, P., Furbach, U., Niemel\u00e4, I.: Hyper tableaux. In: Or\u0142owska, E., Alferes, J.J., Moniz Pereira, L. (eds.) JELIA 1996. LNCS, vol.\u00a01126, Springer, Heidelberg (1996)"},{"issue":"1\u20132","key":"11_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0004-3702(96)00042-2","volume":"90","author":"P. Baumgartner","year":"1997","unstructured":"Baumgartner, P., Furbach, U., Stolzenburg, F.: Computing answers with model elimination. Artificial Intelligence\u00a090(1\u20132), 135\u2013176 (1997)","journal-title":"Artificial Intelligence"},{"key":"11_CR5","unstructured":"Baumgartner, P., Schmidt, R.A.: Blocking and other enhancements for bottom-up model generation methods. Technical report, National ICT Australia, http:\/\/www.nicta.com.au\/director\/research\/publications\/technical_reports.cfm"},{"key":"11_CR6","unstructured":"Bezem, M.: Disproving distributivity in lattices using geometry logic. In: Proc. CADE-20 Workshop on Disproving (2005)"},{"key":"11_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49545-2_9","volume-title":"Logics in Artificial Intelligence","author":"F. Bry","year":"1998","unstructured":"Bry, F., Torge, S.: A deduction method complete for refutation and finite satisfiability. In: Dix, J., Fari\u00f1as del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol.\u00a01489, pp. 1\u201317. Springer, Heidelberg (1998)"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1006291616338","volume":"25","author":"F. Bry","year":"2000","unstructured":"Bry, F., Yahya, A.: Positive unit hyperresolution tableaux for minimal model generation. J. Automated Reasoning\u00a025(1), 35\u201382 (2000)","journal-title":"J. Automated Reasoning"},{"key":"11_CR9","unstructured":"Claessen, K., S\u00f6rensson, N.: New techniques that improve MACE-style finite model building. In: Proc. CADE-19 Workshop on Model Computation (2003)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-56992-8_10","volume-title":"Computer Science Logic","author":"C. Ferm\u00fcller","year":"1993","unstructured":"Ferm\u00fcller, C., Leitsch, A.: Model building by resolution. In: Martini, S., B\u00f6rger, E., Kleine B\u00fcning, H., J\u00e4ger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol.\u00a0702, pp. 134\u2013148. Springer, Heidelberg (1993)"},{"key":"11_CR11","first-page":"52","volume-title":"Proc. IJCAI 1995","author":"M. Fujita","year":"1995","unstructured":"Fujita, M., Slaney, J., Bennett, F.: Automatic generation of some results in finite algebra. In: Proc. IJCAI 1995, pp. 52\u201357. Morgan Kaufmann, San Francisco (1995)"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1005851801356","volume":"18","author":"T. Geisler","year":"1997","unstructured":"Geisler, T., Panne, S., Sch\u00fctz, H.: Satchmo: The compiling and functional variants. J. Automated Reasoning\u00a018(2), 227\u2013236 (1997)","journal-title":"J. Automated Reasoning"},{"key":"11_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-45653-8_6","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"L. Georgieva","year":"2001","unstructured":"Georgieva, L., Hustadt, U., Schmidt, R.A.: Computational space efficiency and minimal model generation for guarded formulae. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 85\u201399. Springer, Heidelberg (2001)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-63104-6_18","volume-title":"Automated Deduction - CADE-14","author":"R. Hasegawa","year":"1997","unstructured":"Hasegawa, R., Inoue, K., Ohta, Y., Koshimura, M.: Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving. In: McCune, W. (ed.) CADE 1997. LNCS, vol.\u00a01249, pp. 176\u2013190. Springer, Heidelberg (1997)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/BFb0012847","volume-title":"9th International Conference on Automated Deduction","author":"R. Manthey","year":"1988","unstructured":"Manthey, R., Bry, F.: SATCHMO: a theorem prover implemented in Prolog. In: Lusk, E.\u2018., Overbeek, R. (eds.) CADE 1988. LNCS, vol.\u00a0310, pp. 415\u2013434. Springer, Heidelberg (1988)"},{"key":"11_CR16","unstructured":"McCune, W.: A Davis-Putnam Program and its Application to Finite First-Order Model Search: Quasigroup Existence Problems. Technical Report MCS-TM-194, ANL (1994)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"McCune, W.: Mace4 reference manual and guide. Technical Memorandum 264, Argonne National Laboratory (2003)","DOI":"10.2172\/822574"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, J., Voronkov, A. (eds.) Handbook of Automated Reasoning, Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50009-6"},{"issue":"3","key":"11_CR19","first-page":"227","volume":"1","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: Automatic deduction with hyper-resolution. Internat. J. Computer Math.\u00a01(3), 227\u2013234 (1965)","journal-title":"Internat. J. Computer Math."},{"key":"11_CR20","unstructured":"Schmidt, R.A.: MSPASS, http:\/\/www.cs.man.ac.uk\/textasciitildeschmidt\/mspass\/"},{"key":"11_CR21","unstructured":"Schmidt, R.A., Hustadt, U.: Solvability with resolution of problems in the Bernays-Sch\u00f6nfinkel class. Presented at Dagstuhl Seminar 05431 and ARW 2006, Bristol (2005)"},{"key":"11_CR22","unstructured":"Slaney, J.: FINDER (finite domain enumerator): Notes and guide. Technical Report TR-ARP-1\/92, Australian National University (1992)"},{"issue":"2","key":"11_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00881955","volume":"13","author":"M.E. Stickel","year":"1994","unstructured":"Stickel, M.E.: Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction. J. Automated Reasoning\u00a013(2), 189\u2013210 (1994)","journal-title":"J. Automated Reasoning"},{"key":"11_CR24","unstructured":"Weidenbach, C.: SPASS, http:\/\/spass.mpi-sb.mpg.de"},{"key":"11_CR25","unstructured":"Wernhard, C.: System description: KRHyper. In: Proc. CADE-19 Workshop on Model Computation: Principles, Algorithms, Applications Systems (2003)"},{"key":"11_CR26","first-page":"298","volume-title":"Proc. IJCAI 1995","author":"H. Zhang","year":"1995","unstructured":"Zhang, H.: Sem: a system for enumerating models. In: Proc. IJCAI 1995, pp. 298\u2013303. Morgan Kaufmann, San Francisco (1995)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814771_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:29Z","timestamp":1605644069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814771_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540371878","9783540371885"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11814771_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}