Benchmark Evaluation of □KE
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1397)
- 220 Downloads
Prover: We used □KE (no version number), which was designed to be a generic theorem prover for the family of 15 normal model logics.
- 2.M. Fitting. Basic modal logic. In D. Gabbay, C. Hogger, & J. Robinson, eds., Handbook of Logic in AI and Logic Programming, vol.1, pp368–448. OUP, 1993.Google Scholar
- 3.J. Pitt and J. Cunningham. Distributed modal theorem proving with KE. In P. Miglioli, U. Moscato, D. Mundici, & M. Ornaghi, eds., Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1071, pp160–176. Springer-Verlag, 1996.Google Scholar
© Springer-Verlag Berlin Heidelberg 1998