Pages that link to "Item:Q4149442"

The following pages link to The Computational Complexity of Provability in Systems of Modal Propositional Logic (Q4149442):

Displaying 50 items.

• Minimal temporal epistemic logic (Q1815428) (← links)
• Domino-tiling games (Q1822501) (← links)
• Guarded fixed point logics and the monadic theory of countable trees. (Q1853504) (← links)
• Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371) (← links)
• Tractable reasoning via approximation (Q1855213) (← links)
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic (Q1855229) (← links)
• Deciding the guarded fragments by resolution (Q1867216) (← links)
• Complexity of computing with extended propositional logic programs (Q1924783) (← links)
• Complexity results of STIT fragments (Q1928487) (← links)
• Deciding the word problem in pure double Boolean algebras (Q1948275) (← links)
• Complexity results for modal dependence logic (Q1956378) (← links)
• The complexity of identifying characteristic formulae (Q1987735) (← links)
• Rules with parameters in modal logic. II. (Q2004954) (← links)
• Computational complexity for bounded distributive lattices with negation (Q2032990) (← links)
• On the proof complexity of logics of bounded branching (Q2084964) (← links)
• NP reasoning in the monotone \(\mu\)-calculus (Q2096471) (← links)
• Efficient SAT-based minimal model generation methods for modal logic S5 (Q2118302) (← links)
• The fluted fragment with transitive relations (Q2238133) (← links)
• Complexity of the universal theory of modal algebras (Q2307300) (← links)
• Decidability of order-based modal logics (Q2361346) (← links)
• How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning (Q2520659) (← links)
• Deciding regular grammar logics with converse through first-order logic (Q2567343) (← links)
• Complexity of modal logics with Presburger constraints (Q2638188) (← links)
• Computational complexity of the word problem in modal and Heyting algebras with a small number of generators (Q2678341) (← links)
• Modal logic S5 in answer set programming with lazy creation of worlds (Q2694545) (← links)
• Hybrid logics: characterization, interpolation and complexity (Q2758042) (← links)
• On the Complexity of the Equational Theory of Residuated Boolean Algebras (Q2820699) (← links)
• Undecidability of Multi-modal Hybrid Logics (Q2867946) (← links)
• Axiomatization and completeness of lexicographic products of modal logics (Q2901209) (← links)
• Modal Inclusion Logic: Being Lax is Simpler than Being Strict (Q2946343) (← links)
• Weak Kripke Structures and LTL (Q3090846) (← links)
• An Epistemic Logic with Hypotheses (Q3094014) (← links)
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957) (← links)
• The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions (Q3584967) (← links)
• The NP-Completeness of Reflected Fragments of Justification Logics (Q3605524) (← links)
• Complexity of intuitionistic propositional logic and its fragments (Q3643316) (← links)
• THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ (Q3646173) (← links)
• Adding clauses to poor man's logic (without increasing the complexity) (Q3647233) (← links)
• BDD-based decision procedures for the modal logic K ★ (Q3647260) (← links)
• Dynamic logics of the region-based theory of discrete spaces (Q3647263) (← links)
• Modal Logics for Parallelism, Orthogonality, and Affine Geometries (Q3647300) (← links)
• Axiomatization and Completeness of Lexicographic Products of Modal Logics (Q3655198) (← links)
• Classifying the computational complexity of problems (Q3781088) (← links)
• What is an inference rule? (Q4032879) (← links)
• Graph decompositions and tree automata in reasoning with uncertainty (Q4286533) (← links)
• On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
• SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation (Q4443408) (← links)
• Complexity of interpolation and related problems in positive calculi (Q4532622) (← links)
• (Q4580320) (← links)
• Modal logics for reasoning about infinite unions and intersections of binary relations (Q4583172) (← links)