hide
Free keywords:
-
Abstract:
This paper reports on empirical performance analysis of four modal
theorem provers on benchmark suites of randomly generated formulae.
The theorem provers tested are the Davis-Putnam-based procedure
K\textsc{sat}, the tableaux-based system $\mathcal{KRIS}$, the
sequent-based Logics Workbench, and a translation approach combined
with the first-order theorem prover SPASS.
Our benchmark suites are sets of multi-modal formulae in a certain
normal form randomly generated according to the scheme of
Giunchiglia and Sebastiani (1996a, 1996b). We investigate the quality
of the random modal formulae and show that the scheme has some
shortcomings, which may lead to mistaken conclusions. We propose
improvements to the evaluation method and show that the translation
approach has superior computational behaviour compared to the other
three approaches.
