Blocking and Other Enhancements for Bottom-Up Model Generation Methods

  • Peter Baumgartner
  • Renate A. Schmidt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4130)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica 69, 5–40 (2001)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Baumgartner, P., Fuchs, A., Tinelli, C.: DARWIN, http://goedel.cs.uiowa.edu/Darwin/
  3. 3.
    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)Google Scholar
  4. 4.
    Baumgartner, P., Furbach, U., Stolzenburg, F.: Computing answers with model elimination. Artificial Intelligence 90(1–2), 135–176 (1997)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    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
  6. 6.
    Bezem, M.: Disproving distributivity in lattices using geometry logic. In: Proc. CADE-20 Workshop on Disproving (2005)Google Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Bry, F., Yahya, A.: Positive unit hyperresolution tableaux for minimal model generation. J. Automated Reasoning 25(1), 35–82 (2000)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Claessen, K., Sörensson, N.: New techniques that improve MACE-style finite model building. In: Proc. CADE-19 Workshop on Model Computation (2003)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Geisler, T., Panne, S., Schütz, H.: Satchmo: The compiling and functional variants. J. Automated Reasoning 18(2), 227–236 (1997)CrossRefGoogle Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    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)CrossRefGoogle Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    McCune, W.: Mace4 reference manual and guide. Technical Memorandum 264, Argonne National Laboratory (2003)Google Scholar
  18. 18.
    Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, J., Voronkov, A. (eds.) Handbook of Automated Reasoning, Elsevier and MIT Press (2001)Google Scholar
  19. 19.
    Robinson, J.A.: Automatic deduction with hyper-resolution. Internat. J. Computer Math. 1(3), 227–234 (1965)MATHGoogle Scholar
  20. 20.
  21. 21.
    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)Google Scholar
  22. 22.
    Slaney, J.: FINDER (finite domain enumerator): Notes and guide. Technical Report TR-ARP-1/92, Australian National University (1992)Google Scholar
  23. 23.
    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)MATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Weidenbach, C.: SPASS, http://spass.mpi-sb.mpg.de
  25. 25.
    Wernhard, C.: System description: KRHyper. In: Proc. CADE-19 Workshop on Model Computation: Principles, Algorithms, Applications Systems (2003)Google Scholar
  26. 26.
    Zhang, H.: Sem: a system for enumerating models. In: Proc. IJCAI 1995, pp. 298–303. Morgan Kaufmann, San Francisco (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Peter Baumgartner
    • 1
  • Renate A. Schmidt
    • 2
  1. 1.National ICT Australia (NICTA) 
  2. 2.The University of Manchester 

Personalised recommendations