The Computational Complexity of Provability in Systems of Modal Propositional Logic

Cited in

(only showing first 100 items - show all)

The complexity of hybrid logics over equivalence relations
Hybrid logics of separation axioms
Belief, awareness, and limited reasoning
Satisfiability in many-valued sentential logic is NP-complete
A class of decidable information logics
Application of modal logic to programming
On the size of refutation Kripke models for some linear modal and tense logics
Control machines: A new model of parallelism for compositional specifications and their effective compilation
TABLEAUX: A general theorem prover for modal logics
A guide to completeness and complexity for modal logics of knowledge and belief
The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
Propositional dynamic logic of regular programs
A simple propositional \(\text{S}5\) tableau system
The complexity of the disjunction and existential properties in intuitionistic logic
A modal perspective on the computational complexity of attribute value grammar
Generalized quantifiers and modal logic
The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
Conditional logics of normality: A modal approach
The complexity of concept languages
A polynomial space construction of tree-like models for logics with local chains of modal connectives
Complexity of some problems in positive and related calculi
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
EXPtime tableaux for ALC
On the relationship between fuzzy description logics and many-valued modal logics
Parameterized modal satisfiability
The price of universality
Minimal temporal epistemic logic
Domino-tiling games
Guarded fixed point logics and the monadic theory of countable trees.
Combining deduction and model checking into tableaux and algorithms for converse-PDL.
Tractable reasoning via approximation
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
Deciding the guarded fragments by resolution
Complexity of computing with extended propositional logic programs
Complexity results of STIT fragments
Deciding the word problem in pure double Boolean algebras
Complexity results for modal dependence logic
The complexity of identifying characteristic formulae
Rules with parameters in modal logic. II.
Computational complexity for bounded distributive lattices with negation
On the proof complexity of logics of bounded branching
NP reasoning in the monotone \(\mu\)-calculus
Efficient SAT-based minimal model generation methods for modal logic S5
The fluted fragment with transitive relations
Complexity of the universal theory of modal algebras
Decidability of order-based modal logics
How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning
Deciding regular grammar logics with converse through first-order logic
Complexity of modal logics with Presburger constraints
Computational complexity of the word problem in modal and Heyting algebras with a small number of generators
Modal logic S5 in answer set programming with lazy creation of worlds
Hybrid logics: Characterization, interpolation and complexity
On the complexity of the equational theory of residuated Boolean algebras
Undecidability of multi-modal hybrid logics
Axiomatization and completeness of lexicographic products of modal logics
Modal inclusion logic: being lax is simpler than being strict
Weak Kripke structures and LTL
An epistemic logic with hypotheses
The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
The NP-Completeness of Reflected Fragments of Justification Logics
Complexity of intuitionistic propositional logic and its fragments
THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
Adding clauses to poor man's logic (without increasing the complexity)
BDD-based decision procedures for the modal logic K ★
Dynamic logics of the region-based theory of discrete spaces
Modal Logics for Parallelism, Orthogonality, and Affine Geometries
Axiomatization and Completeness of Lexicographic Products of Modal Logics
Classifying the computational complexity of problems
Three-valued logics in modal logic
Loop-free calculus for modal logic S4. I
What is an inference rule?
Lower complexity bounds in justification logic
Graph decompositions and tree automata in reasoning with uncertainty
On the Decision Problem for Two-Variable First-Order Logic
SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation
Complexity of interpolation and related problems in positive calculi
scientific article; zbMATH DE number 6917935 (Why is no real title available?)
Modal logics for reasoning about infinite unions and intersections of binary relations
Separation logics and modalities: a survey
Hintikka multiplicities in matrix decision methods for some propositional modal logics
Quirky quantifiers: optimal models and complexity of computation tree logic
A simple tableau system for the logic of elsewhere
Efficient loop-check for backward proof search in some non-classical propositional logics
THE TEMPORAL LOGIC OF TWO DIMENSIONAL MINKOWSKI SPACETIME IS DECIDABLE
ON THE COMPLEXITY OF COALITIONAL REASONING
On the complexity of the closed fragment of Japaridze's provability logic
Public announcement logic with distributed knowledge: expressivity, completeness and complexity
Logics and algebras for multiple players
On the Restraining Power of Guards
The complexity of satisfiability for fragments of CTL and \(\text{CTL}^*\)
Team semantics for the specification and verification of hyperproperties
Semiring Provenance for Guarded Logics
Modal logic S5 satisfiability in answer set programming
Expressivity within second-order transitive-closure logic
The Fluted Fragment with Transitivity
Model checking and validity in propositional and modal inclusion logics
A note on the complexity of \textbf{S4.2}

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)