Abstract
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order problems into a certain implicational form, namely range-restricted clauses. These refine existing transformations to range-restricted form by extending the domain of interpretation with new Skolem terms in a more careful and deliberate way. Our transformations also extend BUMG with a blocking technique for detecting recurrence in models. Blocking is based on a conceptually rather simple encoding together with standard equality theorem proving and redundancy elimination techniques. This provides a general-purpose method for finding small models. The presented techniques are implemented and have been successfully tested with existing theorem provers on the satisfiable problems from the TPTP library.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica 69, 5–40 (2001)
Baumgartner, P., Fuchs, A., Tinelli, C.: DARWIN, http://goedel.cs.uiowa.edu/Darwin/
Baumgartner, P., Furbach, U., Niemelä, I.: Hyper tableaux. In: Orłowska, E., Alferes, J.J., Moniz Pereira, L. (eds.) JELIA 1996. LNCS, vol. 1126, Springer, Heidelberg (1996)
Baumgartner, P., Furbach, U., Stolzenburg, F.: Computing answers with model elimination. Artificial Intelligence 90(1–2), 135–176 (1997)
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
Bezem, M.: Disproving distributivity in lattices using geometry logic. In: Proc. CADE-20 Workshop on Disproving (2005)
Bry, F., Torge, S.: A deduction method complete for refutation and finite satisfiability. In: Dix, J., Fariñas del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol. 1489, pp. 1–17. Springer, Heidelberg (1998)
Bry, F., Yahya, A.: Positive unit hyperresolution tableaux for minimal model generation. J. Automated Reasoning 25(1), 35–82 (2000)
Claessen, K., Sörensson, N.: New techniques that improve MACE-style finite model building. In: Proc. CADE-19 Workshop on Model Computation (2003)
Fermüller, C., Leitsch, A.: Model building by resolution. In: Martini, S., Börger, E., Kleine Büning, H., Jäger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol. 702, pp. 134–148. Springer, Heidelberg (1993)
Fujita, M., Slaney, J., Bennett, F.: Automatic generation of some results in finite algebra. In: Proc. IJCAI 1995, pp. 52–57. Morgan Kaufmann, San Francisco (1995)
Geisler, T., Panne, S., Schütz, H.: Satchmo: The compiling and functional variants. J. Automated Reasoning 18(2), 227–236 (1997)
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. 2250, pp. 85–99. Springer, Heidelberg (2001)
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. 1249, pp. 176–190. Springer, Heidelberg (1997)
Manthey, R., Bry, F.: SATCHMO: a theorem prover implemented in Prolog. In: Lusk, E.‘., Overbeek, R. (eds.) CADE 1988. LNCS, vol. 310, pp. 415–434. Springer, Heidelberg (1988)
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)
McCune, W.: Mace4 reference manual and guide. Technical Memorandum 264, Argonne National Laboratory (2003)
Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, J., Voronkov, A. (eds.) Handbook of Automated Reasoning, Elsevier and MIT Press (2001)
Robinson, J.A.: Automatic deduction with hyper-resolution. Internat. J. Computer Math. 1(3), 227–234 (1965)
Schmidt, R.A.: MSPASS, http://www.cs.man.ac.uk/textasciitildeschmidt/mspass/
Schmidt, R.A., Hustadt, U.: Solvability with resolution of problems in the Bernays-Schönfinkel class. Presented at Dagstuhl Seminar 05431 and ARW 2006, Bristol (2005)
Slaney, J.: FINDER (finite domain enumerator): Notes and guide. Technical Report TR-ARP-1/92, Australian National University (1992)
Stickel, M.E.: Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction. J. Automated Reasoning 13(2), 189–210 (1994)
Weidenbach, C.: SPASS, http://spass.mpi-sb.mpg.de
Wernhard, C.: System description: KRHyper. In: Proc. CADE-19 Workshop on Model Computation: Principles, Algorithms, Applications Systems (2003)
Zhang, H.: Sem: a system for enumerating models. In: Proc. IJCAI 1995, pp. 298–303. Morgan Kaufmann, San Francisco (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baumgartner, P., Schmidt, R.A. (2006). Blocking and Other Enhancements for Bottom-Up Model Generation Methods. In: Furbach, U., Shankar, N. (eds) Automated Reasoning. IJCAR 2006. Lecture Notes in Computer Science(), vol 4130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814771_11
Download citation
DOI: https://doi.org/10.1007/11814771_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37187-8
Online ISBN: 978-3-540-37188-5
eBook Packages: Computer ScienceComputer Science (R0)