The following pages link to (Q4833777):
Displaying 49 items.
- The decision problem of modal product logics with a diagonal, and faulty counter machines (Q295920) (← links)
- A description logic based situation calculus (Q604908) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- A modal logic framework for reasoning about comparative distances and topology (Q636293) (← links)
- \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
- All finitely axiomatizable tense logics of linear time flows are coNP-complete (Q817685) (← links)
- Multimodal logics of products of topologies (Q861569) (← links)
- Complexity of admissible rules (Q868660) (← links)
- An NP-complete fragment of fibring logic (Q905999) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- On the polynomial-space completeness of intuitionistic propositional logic (Q1411664) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- The decision problem of provability logic with only one atom (Q1423633) (← links)
- Parameterized modal satisfiability (Q1759682) (← links)
- Combining temporal logic systems (Q1815427) (← links)
- Guarded fixed point logics and the monadic theory of countable trees. (Q1853504) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Partial up an down logic (Q1903583) (← links)
- Relation algebras can tile (Q1961863) (← links)
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments (Q2303247) (← links)
- Complexity of the universal theory of modal algebras (Q2307300) (← links)
- Sequent calculi for global modal consequence relations (Q2323632) (← links)
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics (Q2432763) (← links)
- Non-primitive recursive decidability of products of modal logics with expanding domains (Q2503403) (← 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)
- : A Resolution-Based Prover for Multimodal K (Q2817940) (← links)
- Undecidability of Multi-modal Hybrid Logics (Q2867946) (← links)
- Non-finitely axiomatisable two-dimensional modal logics (Q2915901) (← links)
- PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES AND PERIODIC POLICIES WITH APPLICATIONS (Q3165699) (← links)
- Terminating Tableaux for Dynamic Epistemic Logics (Q3185765) (← links)
- NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706) (← links)
- A Modal-Layered Resolution Calculus for K (Q3455770) (← links)
- Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse (Q3541703) (← links)
- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions (Q3584967) (← links)
- Complexity of intuitionistic propositional logic and its fragments (Q3643316) (← links)
- PDL for ordered trees (Q3647225) (← links)
- The Range of Modal Logic (Q4531586) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- HTab: a Terminating Tableaux System for Hybrid Logic (Q4982111) (← links)
- Hybrid Tableaux for the Difference Modality (Q4982124) (← links)
- Semiring Provenance for Guarded Logics (Q5015965) (← links)
- EXPLORING THE LANDSCAPE OF RELATIONAL SYLLOGISTIC LOGICS (Q5024507) (← links)
- Temporal Logic of Minkowski Spacetime (Q5027245) (← links)
- A note on the complexity of S4.2 (Q5156186) (← links)
- Logic and Complexity in Cognitive Science (Q5249690) (← links)
- Modal Logics with Hard Diamond-Free Fragments (Q5283414) (← links)
- CoNP complexity for combinations of non-normal modal logics (Q6541159) (← links)
