The Computational Complexity of Provability in Systems of Modal Propositional Logic

Cited in

(only showing first 100 items - show all)

The price of universality
How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning
Hybrid logics of separation axioms
The complexity of hybrid logics over equivalence relations
Deciding the word problem in pure double Boolean algebras
On the size of refutation Kripke models for some linear modal and tense logics
Minimal temporal epistemic logic
Dynamic logic as a uniform framework for theorem proving in intensional logic
Hypothetical datalog: Complexity and expressibility
Complexity through translations for modal logic with recursion
Complexity of interpolation and related problems in positive calculi
Mechanising Gödel-Löb provability logic in HOL light
THE TEMPORAL LOGIC OF TWO DIMENSIONAL MINKOWSKI SPACETIME IS DECIDABLE
TABLEAUX: A general theorem prover for modal logics
Classifying the computational complexity of problems
Quirky quantifiers: optimal models and complexity of computation tree logic
The complexity of the disjunction and existential properties in intuitionistic logic
Open answer set programming for the semantic web
On Composing Finite Forests with Modal Logics
Parameterized modal satisfiability
The NP-Completeness of Reflected Fragments of Justification Logics
Computational complexity of the word problem in modal and Heyting algebras with a small number of generators
scientific article; zbMATH DE number 6917935 (Why is no real title available?)
On the polynomial-space completeness of intuitionistic propositional logic
A simple propositional \(\text{S}5\) tableau system
The Fluted Fragment with Transitivity
The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
Modal logic S5 in answer set programming with lazy creation of worlds
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
Model checking and validity in propositional and modal inclusion logics
Complexity of validity for propositional dependence logics
Logics and algebras for multiple players
Hybrid logics: Characterization, interpolation and complexity
scientific article; zbMATH DE number 7056228 (Why is no real title available?)
An epistemic logic with hypotheses
NP reasoning in the monotone \(\mu\)-calculus
Hybrid modal operators for definite descriptions
3-SAT = SAT for a class of normal modal logics
THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
Loop-free calculus for modal logic S4. I
Team semantics for the specification and verification of hyperproperties
The complexity of identifying characteristic formulae
Guarded fixed point logics and the monadic theory of countable trees.
From KLM-style conditionals to defeasible modalities, and back
Expressivity and Complexity of Dependence Logic
On the complexity of the equational theory of residuated Boolean algebras
The complexity of satisfiability for fragments of hybrid logic. I.
Complexity of the universal theory of modal algebras
Application of modal logic to programming
Improved decision procedures for the modal logics K, T and S4
On the modal logic K plus theories
Dynamic logics of the region-based theory of discrete spaces
A polynomial space construction of tree-like models for logics with local chains of modal connectives
Lower complexity bounds in justification logic
Derivability in certain subsystems of the logic of proofs is _2p-complete
On the Decision Problem for Two-Variable First-Order Logic
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
Axiomatization and completeness of lexicographic products of modal logics
Modal inclusion logic: being lax is simpler than being strict
A note on the complexity of \textbf{S4.2}
Topological modal logics satisfying finite chain conditions
Rules with parameters in modal logic. II.
Efficient SAT-based minimal model generation methods for modal logic S5
Separation logics and modalities: a survey
Modal logics with hard diamond-free fragments
The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
Complexity of admissible rules
A nonstandard approach to the logical omniscience problem
Adding clauses to poor man's logic (without increasing the complexity)
On the Restraining Power of Guards
The complexity of concept languages
Deciding regular grammar logics with converse through first-order logic
General default logic
Weak Kripke structures and LTL
Belief, awareness, and limited reasoning
Domino-tiling games
Propositional dynamic logic of regular programs
A logic for metric and topology
The fluted fragment with transitive relations
Modal logic S5 satisfiability in answer set programming
The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
Modal logics for reasoning about infinite unions and intersections of binary relations
Proof complexity of non-classical logics
Graph decompositions and tree automata in reasoning with uncertainty
SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation
Frame definability in finitely valued modal logics
Hyper arrow logic with indiscernibility and complementarity
A simple tableau system for the logic of elsewhere
Axiomatization and Completeness of Lexicographic Products of Modal Logics
\({\mathcal E}\)-connections of abstract description systems
A class of decidable information logics
Complexity results for modal logic with recursion via translations and tableaux
scientific article; zbMATH DE number 7533347 (Why is no real title available?)
The complexity of satisfiability for fragments of CTL and \(\text{CTL}^*\)

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)