The Computational Complexity of Provability in Systems of Modal Propositional Logic

Cited In (only showing first 100 items - show all)

Loop-free calculus for modal logic S4. I
Complexity of the universal theory of modal algebras
The complexity of satisfiability for fragments of hybrid logic. I.
Dynamic logics of the region-based theory of discrete spaces
Application of modal logic to programming
On the Decision Problem for Two-Variable First-Order Logic
Lower complexity bounds in justification logic
Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete
Complexity of some problems in positive and related calculi
The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
Undecidability of multi-modal hybrid logics
Generalized modal satisfiability
Separation logics and modalities: a survey
A nonstandard approach to the logical omniscience problem
The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
On the Restraining Power of Guards
Complexity of admissible rules
Deciding regular grammar logics with converse through first-order logic
The complexity of concept languages
Belief, awareness, and limited reasoning
A logic for metric and topology
Domino-tiling games
Proof complexity of non-classical logics
The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
Propositional dynamic logic of regular programs
\({\mathcal E}\)-connections of abstract description systems
The complexity of satisfiability for fragments of CTL and \(\text{CTL}^*\)
Satisfiability in many-valued sentential logic is NP-complete
BDD-based decision procedures for the modal logic K ★
Uniform interpolation and propositional quantifiers in modal logics
Coalgebraic semantics of modal logics: an overview
On the decidability of elementary modal logics
EXPtime tableaux for ALC
Complexity results of STIT fragments
A logic for reasoning about counterfactual emotions
Tractable reasoning via approximation
Mathematical modal logic: A view of its evolution
Decidability of order-based modal logics
Combining deduction and model checking into tableaux and algorithms for converse-PDL.
On the proof complexity of logics of bounded branching
Efficient loop-check for backward proof search in some non-classical propositional logics
Complexity results for modal dependence logic
Symmetric blocking
A guide to completeness and complexity for modal logics of knowledge and belief
Modal Logics for Parallelism, Orthogonality, and Affine Geometries
Conditional logics of normality: A modal approach
Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
Complexity of hybrid logics over transitive frames
An NP-complete fragment of fibring logic
Deciding the guarded fragments by resolution
What is an inference rule?
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
On the complexity of the closed fragment of Japaridze's provability logic
Public announcement logic with distributed knowledge: expressivity, completeness and complexity
Complexity of intuitionistic propositional logic and its fragments
The price of universality
Hybrid logics of separation axioms
The complexity of hybrid logics over equivalence relations
Complexity of interpolation and related problems in positive calculi
On the size of refutation Kripke models for some linear modal and tense logics
Hypothetical datalog: Complexity and expressibility
Classifying the computational complexity of problems
TABLEAUX: A general theorem prover for modal logics
The complexity of the disjunction and existential properties in intuitionistic logic
Title not available (Why is that?)
The NP-Completeness of Reflected Fragments of Justification Logics
Open answer set programming for the semantic web
Parameterized modal satisfiability
On the polynomial-space completeness of intuitionistic propositional logic
A simple propositional \(\text{S}5\) tableau system
Generalized quantifiers and modal logic
ON THE COMPLEXITY OF COALITIONAL REASONING
The decision problem of provability logic with only one atom
Three-valued logics in modal logic
Title not available (Why is that?)
Complexity of validity for propositional dependence logics
Hybrid logics: Characterization, interpolation and complexity
An epistemic logic with hypotheses
THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
3-SAT = SAT for a class of normal modal logics
From KLM-style conditionals to defeasible modalities, and back
Expressivity and Complexity of Dependence Logic
The complexity of identifying characteristic formulae
Guarded fixed point logics and the monadic theory of countable trees.
On the complexity of the equational theory of residuated Boolean algebras
Improved decision procedures for the modal logics K, T and S4
On the modal logic K plus theories
A polynomial space construction of tree-like models for logics with local chains of modal connectives
Axiomatization and completeness of lexicographic products of modal logics
Topological modal logics satisfying finite chain conditions
A note on the complexity of \textbf{S4.2}
Modal inclusion logic: being lax is simpler than being strict
Rules with parameters in modal logic. II.
Efficient SAT-based minimal model generation methods for modal logic S5
Modal logics with hard diamond-free fragments
Adding clauses to poor man's logic (without increasing the complexity)
Weak Kripke structures and LTL
General default logic
Modal logic S5 satisfiability in answer set programming
Modal logics for reasoning about infinite unions and intersections of binary relations

This page was built for publication: The Computational Complexity of Provability in Systems of Modal Propositional Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4149442)