scientific article; zbMATH DE number 757645

Publication date: 23 May 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

complexity propositional modal logics satisfiability PSPACE-completeness propositional tense logics

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (48)

Modal Logics with Hard Diamond-Free Fragments ⋮ The Range of Modal Logic ⋮ PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES AND PERIODIC POLICIES WITH APPLICATIONS ⋮ The decision problem of modal product logics with a diagonal, and faulty counter machines ⋮ A Modal-Layered Resolution Calculus for K ⋮ Complexity of modal logics with Presburger constraints ⋮ Terminating Tableaux for Dynamic Epistemic Logics ⋮ Non-finitely axiomatisable two-dimensional modal logics ⋮ Partial up an down logic ⋮ Multimodal logics of products of topologies ⋮ NEXP-Completeness and Universal Hardness Results for Justification Logic ⋮ Complexity of admissible rules ⋮ A description logic based situation calculus ⋮ Separation logics and modalities: a survey ⋮ Computational complexity of the word problem in modal and Heyting algebras with a small number of generators ⋮ A polynomial space construction of tree-like models for logics with local chains of modal connectives ⋮ Complexity of hybrid logics over transitive frames ⋮ An NP-complete fragment of fibring logic ⋮ A new combination procedure for the word problem that generalizes fusion decidability results in modal logics ⋮ A modal logic framework for reasoning about comparative distances and topology ⋮ On the polynomial-space completeness of intuitionistic propositional logic ⋮ Mathematical modal logic: A view of its evolution ⋮ The decision problem of provability logic with only one atom ⋮ Relation algebras can tile ⋮ Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse ⋮ A note on the complexity of S4.2 ⋮ Parameterized modal satisfiability ⋮ The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions ⋮ Non-primitive recursive decidability of products of modal logics with expanding domains ⋮ \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments ⋮ : A Resolution-Based Prover for Multimodal K ⋮ Complexity of the universal theory of modal algebras ⋮ Combining temporal logic systems ⋮ Complexity of intuitionistic propositional logic and its fragments ⋮ HTab: a Terminating Tableaux System for Hybrid Logic ⋮ Hybrid Tableaux for the Difference Modality ⋮ PDL for ordered trees ⋮ Sequent calculi for global modal consequence relations ⋮ Deciding regular grammar logics with converse through first-order logic ⋮ Logic and Complexity in Cognitive Science ⋮ Guarded fixed point logics and the monadic theory of countable trees. ⋮ The complexity of propositional linear temporal logics in simple cases ⋮ Semiring Provenance for Guarded Logics ⋮ Undecidability of Multi-modal Hybrid Logics ⋮ EXPLORING THE LANDSCAPE OF RELATIONAL SYLLOGISTIC LOGICS ⋮ Temporal Logic of Minkowski Spacetime ⋮ \({\mathcal E}\)-connections of abstract description systems ⋮ All finitely axiomatizable tense logics of linear time flows are coNP-complete

This page was built for publication: