How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi

Abstract

We present a bottom-up decision procedure for propositional modal logic K based on the inverse method. The procedure is based on the &#8220;inverted&#8221; version of a sequent calculus. To restrict the search space, we prove a number of redundancy criteria for derivations in the sequent calculus. We introduce <italic>a new technique</italic> of proving redundancy criteria, based on the analysis of tableau-based derivations in K. Moreover, another new technique is based on so-called <italic>traces</italic>. A new search with a strong notion of subsumption. This technique is based on so-called <italic>traces</italic>. A new formalization of the inverse method in the form of a <italic>path calculus</italic> considerably simplifies all proofs as compared to the previously published presentations of the inverse method. Experimental results demonstrate that our method is competitive with many state-of-the-art implementations of K.

DOI: 10.1145/371316.371511

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@article{Voronkov2001HowTO, title={How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi}, author={Andrei Voronkov}, journal={ACM Trans. Comput. Log.}, year={2001}, volume={2}, pages={182-215} }