Satchmo: The compiling and functional variants

Journal of Automated Reasoning

Volumn 18, Issue 2, 1997, Pages 227-236

  Geisler, Tim ^a   Panne, Sven ^a   Schütz, Heribert ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Automated theorem proving; Competition; Compilation; Incremental evaluation; Satchmo

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LANGUAGES; FORMAL LOGIC; MATHEMATICAL MODELS; PROGRAM COMPILERS; PROGRAM INTERPRETERS;

AUTOMATED THEOREM PROVING (ATP); INCREMENTAL EVALUATION;

THEOREM PROVING;

EID: 0031109239     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1005851801356     Document Type: Article

References (19)

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.
4. Fermüller, C. and Leitsch, A.: Hyperresolution and automated model building, Journal of Logic and Computation 6(2) (1996), 173-203.
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.
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.
12. McCune, W. W.: Otter 3.0 Reference Manual and Guide, Technical Report ANL 94/6, Argonne National Laboratory, Argonne, IL, USA, 1994.
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.
14. Sahlin, D.: An Automatic Partial Evaluator for Full Prolog. SICS Dissertation Series 04, The Royal Institute of Technology (KTH), Stockholm, Sweden, 1991.
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.