The Computational Complexity of Provability in Systems of Modal Propositional Logic

Cited in

(only showing first 100 items - show all)

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}^*\)
Satisfiability in many-valued sentential logic is NP-complete
Coalgebraic semantics of modal logics: an overview
Uniform interpolation and propositional quantifiers in modal logics
EXPtime tableaux for ALC
BDD-based decision procedures for the modal logic K ★
Lattice logic as a fragment of (2-sorted) residuated modal logic
Complexity results of STIT fragments
On the decidability of elementary modal logics
A logic for reasoning about counterfactual emotions
Complexity of modal logics with Presburger constraints
Computational complexity for bounded distributive lattices with negation
Tractable reasoning via approximation
Hyper arrow logic with indiscernibility and complementarity
Completing the Picture: Complexity of Graded Modal Logics with Converse
Mathematical modal logic: A view of its evolution
Combining deduction and model checking into tableaux and algorithms for converse-PDL.
Decidability of order-based modal logics
On the proof complexity of logics of bounded branching
Complexity of computing with extended propositional logic programs
Symmetric blocking
Complexity results for modal dependence logic
A guide to completeness and complexity for modal logics of knowledge and belief
Efficient loop-check for backward proof search in some non-classical propositional logics
Hintikka multiplicities in matrix decision methods for some propositional modal logics
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
A modal perspective on the computational complexity of attribute value grammar
Semiring Provenance for Guarded Logics
Control machines: A new model of parallelism for compositional specifications and their effective compilation
A nonstandard approach to the logical omniscience problem
Deciding the guarded fragments by resolution
On the relationship between fuzzy description logics and many-valued modal logics
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
What is an inference rule?
On the complexity of the closed fragment of Japaridze's provability logic
Public announcement logic with distributed knowledge: expressivity, completeness and complexity
The Complexity of Decomposing Modal and First-Order Theories
Complexity of intuitionistic propositional logic and its fragments

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)