论文信息 - Improved Decision Procedures for the Modal Logics K, T, and S4

Improved Decision Procedures for the Modal Logics K, T, and S4

We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more efficient decision procedures than those hitherto known. In particular space requirements for our logics are lowered from the previously established bounds of the form n2, n3 and n4 to n log n, n log n, and n2 log n respectively.

Jörg Hudelmaier | J. Hudelmaier

[1] Jörg Hudelmaier,et al. An O(n log n)-Space Decision Procedure for Intuitionistic Propositional Logic , 1993, J. Log. Comput..

[2] Grigori Mints,et al. Gentzen-type systems and resolution rules. Part I. Propositional logic , 1990, Conference on Computer Logic.

[3] Zoran Ognjanovic. A Tableau-Like Proof Procedure for Normal Modal Logics , 1994, Theor. Comput. Sci..

[4] Joseph Y. Halpern. The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..

[5] M. Fitting. Proof Methods for Modal and Intuitionistic Logics , 1983 .

[6] I-Peng Lin,et al. The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics , 1994, Theor. Comput. Sci..

[7] Richard E. Ladner,et al. The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..