Optimised Functional Translation and Resolution
Prover: We facilitate modal theorem proving in a first-order resolution calculus implemented in SPASS Version 0.77 . SPASS uses ordered resolution and ordered factoring, it supports splitting and branch condensing (splitting amounts to case analysis while branch condensing resembles branch pruning in the Logics Workbench), it has an extensive set of reduction rules including tautology deletion, subsumption and condensing, and it supports dynamic sort theories by additional inference and reduction rules.
- 1.U. Hustadt and R. A. Schmidt. On evaluating decision procedures for modal logics. In Proc. IJCAI’97, pages 202–207, 1997.Google Scholar
- 2.H. J. Ohlbach and R. A. Schmidt. Functional translation and second-order frame properties of modal logics. Res. Report MPI-I-95-2-002, MPI f. Informatik, Saarbrücken, 1995.Google Scholar
- 3.R. A. Schmidt. Resolution is a decision procedure for many propositional modal logics: Extended abstract. To appear in Proc. AiML’96, 1997.Google Scholar
- 4.C. Weidenbach, B. Gaede, and G. Rock. SPASS & FLOTTER version 0.42. In Proc. CADE-13, LNAI 1104, pages 141–145, 1996.Google Scholar