Spass version 2.0

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2392, Issue , 2002, Pages 275-279

  Weidenbach, Christoph ^a   Brahm, Uwe ^a   Hillenbrand, Thomas ^a   Keen, Enno ^a   Theobald, Christian ^a   Topić, Dalibor ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FORMAL LOGIC;

AUTOMATED THEOREM PROVER; CLAUSE-NORMAL-FORM TRANSFORMATION; FIRST-ORDER LOGIC WITH EQUALITY; SYSTEM DESCRIPTION;

THEOREM PROVING;

EID: 70350690461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_22     Document Type: Conference Paper

References (12)

1. Afshordel, B., Hillenbrand, T. & Weidenbach, C. (2001), First-order atom definitions extended, in R. Nieuwenhuis & A. Voronkov, eds, ‘Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2001’, Vol. 2250 of LNAI, Springer, pp. 309-319.
2. Antoniou, G. & Ohlbach, H. J. (1983), Terminator, in A. Bundy, ed., ‘Proceedings of 8th International Joint Conference on Artificial Intelligence, IJCAI-83’, pp. 916-919.
3. Bachmair, L. & Ganzinger, H. (1994), ‘Rewrite-based equational theorem proving with selection and simplification’, Journal of Logic and Computation.
4. Balbiani, P. (1995), Equation solving in geometrical theories, in N. Dershowitz & N. Lindenstrauss, eds, ‘Proceedings of the 4th international workshop on conditional and typed rewriting systems’, Vol. 968 of LNCS, Springer.
5. Brinker, C. (2000), Geometrisches Schliessen mit Spass, Diplomarbeit, Universität des Saarlandes and Max-Planck-Institut für Informatik, Saarbrücken, Germany.
6. Downey, P. J., Sethi, R. & Tarjan, R. E. (1980), ‘Variations on the common subexpression problem’, Journal of the ACM 27(4), 758-771.
7. Ganzinger, H., Meyer, C. & Weidenbach, C. (1997), Soft typing for ordered resolution, in ‘Proceedings of the 14th International Conference on Automated Deduction, CADE-14’, Vol. 1249 of LNAI, Springer, Townsville, Australia, pp. 321-335.
8. Hillenbrand, T., Jaeger, A. & Löchner, B. (1999), Waldmeister -improvements in performance and ease of use, in H. Ganzinger, ed., ‘16th International Conference on Automated Deduction, CADE-16’, LNAI, Springer, pp. 232-236.
9. Nonnengart, A. & Weidenbach, C. (2001), Computing small clause normal forms, in A. Robinson & A. Voronkov, eds, ‘Handbook of Automated Reasoning’, Vol. 1, Elsevier, chapter 6, pp. 335-367.
10. Topić, D. (2002), Static analysis of list-processing C programs, Diplomarbeit, Universität des Saarlandes and Max-Planck-Institut für Informatik, Saarbrücken, Germany.
11. Weidenbach, C. (2001), Combining superposition, sorts and splitting, in A. Robinson & A. Voronkov, eds, ‘Handbook of Automated Reasoning’, Vol. 2, Elsevier, chapter 27, pp. 1965-2012.
12. Weidenbach, C., Afshordel, B., Brahm, U., Cohrs, C., Engel, T., Keen, E., Theobalt, C. & Topic, D. (1999), System description: Spass version 1.0.0, in H. Ganzinger, ed., ‘16th International Conference on Automated Deduction, CADE-16’, Vol. 1632 of LNAI, Springer, pp. 314-318.