Skip to main content
SpringerLink
Log in

Satchmo - The Compiling and Functional Variants

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Compiling Satchmo and Functional Satchmo are two variants of the model generator Satchmo, incorporating enhancements in different directions. Compiling Satchmo is based on the observation that Satchmo (like any model generator or theorem prover) can be seen as an interpreter for a program given as a logical theory, and that this interpretation layer can be avoided by compilation of the theory into a directly executable program. Functional Satchmo is an implementation of Satchmo's calculus in a purely functional language supporting lazy evaluation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bry, F. and Yahya, A.:. Minimal model generation with positive unit hyper-resolution tableaux, in Proc. of the 5th Workshop on Theorem Proving with Tableaux and Related Methods, Lecture Notes in Artificial Intelligence 1071, Springer-Verlag, 1996, pp. 143–159.

  2. Bundy, A. (ed.): Proc. of the 12th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 814, Springer-Verlag, 1994.

  3. Denecker, M. and De Schreye, D.: On the duality of abduction and model generation in a framework for model generation with equality, Theoretical Computer Science 122(1-2) (1994), 225–262.

    Google Scholar 

  4. Fermüller, C. and Leitsch, A.: Hyperresolution and automated model building, Journal of Logic and Computation 6(2) (1996), 173–203.

    Google Scholar 

  5. Fujita, H. and Hasegawa, R.: A model generation theorem prover in KL1 using a Ramified-Stack algorithm, in K. Furukawa (ed.), Proc. of the 8th International Conference on Logic Programming, MIT Press, 1991, pp. 535–548.

  6. Goller, C., Letz, R., Mayr, K. and Schumann, J.: SETHEO V3.2: Recent developments, in [2], pp. 778–782.

  7. Graf, P.: Term Indexing, Lecture Notes in Artificial Intelligence 1053, Springer-Verlag, 1996.

  8. Institute for New Generation Computer Technology. Model Generation Theorem Prover: MGTP, 1995. http://www.icot.or.jp/ICOT/IFS/IFS-abst/081.html.

  9. Loveland, D. W., Reed, D. W. and Wilson, D. S.: SATCHMORE: SATCHMO with RElevancy, Journal of Automated Reasoning 14 (1995), 325–351.

    Google Scholar 

  10. Manthey, R. and Bry, F.: SATCHMO: A theorem prover implemented in Prolog, in E. L. Lusk and R. A. Overbeek (eds), Proc. of the 9th International Conference on Automated Deduction, Lecture Notes in Computer Science 310, Springer-Verlag, 1988, pp. 415–434.

  11. McCune, W. W.: A Davis-Putnam Program and Its Application to Finite First-Order Model Seach: Quasigroup Existence Problems, Technical Report ANL/MCS-TM-194, Argonne National Laboratory, Argonne, IL, USA, 1994.

    Google Scholar 

  12. McCune, W. W.: Otter 3.0 Reference Manual and Guide, Technical Report ANL 94/6, Argonne National Laboratory, Argonne, IL, USA, 1994.

    Google Scholar 

  13. Peterson, J. and K. Hammond, K.: Haskell 1.3 - a Non-Strict, Purely Functional Language, Research Report YALEU/DCS/RR-1106, Yale University, New Haven, CT, USA, 1996.

    Google Scholar 

  14. Sahlin, D.: An Automatic Partial Evaluator for Full Prolog. SICS Dissertation Series 04, The Royal Institute of Technology (KTH), Stockholm, Sweden, 1991.

    Google Scholar 

  15. Schütz, H. and Geisler, T.: Efficient model generation through compilation, in M. McRobbie and J. Slaney (eds), Proc. of the 13th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 1104, Springer-Verlag, 1996, pp. 433–447.

  16. Slaney, J.: FINDER: Finite domain enumerator - system description, in [2], pp. 252–266.

  17. Sutcliffe, G., Suttner, C. B. and Yemenis, T.: The TPTP problem library, in [2], pp. 252–266.

  18. Sutcliffe, G. and Suttner, C. B.: The procedures of the CADE-13 ATP system competition, Journal of Automated Reasoning 18(2) (1997).

  19. Zhang, J. and Zhang, H.: SEM: A system for enumerating models, in Proc. of the 14th International Joint Conference on Artificial Intelligence, 1995, pp. 298–303.

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität München, München, Germany

    Tim Geisler, Sven Panne & Heribert Schütz

Authors
  1. Tim Geisler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sven Panne
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Heribert Schütz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Geisler, T., Panne, S. & Schütz, H. Satchmo - The Compiling and Functional Variants. Journal of Automated Reasoning 18, 227–236 (1997). https://doi.org/10.1023/A:1005851801356

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005851801356

Search

Navigation