An O ((n·log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic

Authors:
Stéphane Demri;Rajeev Goré
Affiliations:
-;-
Venue:
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Year:
2000

Citing 11
Cited 3

Modal theorem proving

Proc. of the 8th international conference on Automated deduction
First-order modal tableaux

Journal of Automated Reasoning
Gentzen-type systems and resolution rules. Part I. Propositional logic

COLOG-88 Proceedings of the international conference on Computer logic
Optimized Translation of Multi Modal Logic into Predicate Logic

LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Improved Decision Procedures for the Modal Logics K, T, and S4

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
An O ((n·log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)

Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Resolution-Based Calculi for Modal and Temporal Logics

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Combining Hilbert Style and Semantic Reasoning in a Resolution Framework

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A Resolution Decision Procedure for the Guarded Fragment

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Methods for Automated Theorem Proving in Nonclassical Logics

IEEE Transactions on Computers

An O ((n·log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Tractable Transformations from Modal Provability Logics into First-Order Logic

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
A survey on temporal logics for specifying and verifying real-time systems

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

The provability logic Grz is characterized by a class of modal frames that is not first-order definable. We present a simple embedding of Grz into decidable fragments of classical first-order logic such as FO2 and the guarded fragment. The embedding is an O((n.log n)3)-time transformation that neither involves first principles about Turing machines (and therefore is easy to implement), nor the semantical characterization of Grz (and therefore does not use any second-order machinery). Instead, we use the syntactic relationships between cut-free sequent-style calculi for Grz, S4 and T. We first translate Grz into T, and then we use the relational translation from T into FO2