The following pages link to Computer Science Logic (Q5394587):
Displayed 21 items.
- The complexity of satisfiability for fragments of hybrid logic. I. (Q631087) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) (← links)
- Hybrid logical analyses of the ambient calculus (Q964494) (← links)
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- Complexity and succinctness issues for linear-time hybrid logics (Q1044839) (← links)
- The complexity of hybrid logics over equivalence relations (Q1047797) (← links)
- Branching-time logics repeatedly referring to states (Q1047801) (← links)
- A prover dealing with nominals, binders, transitivity and relation hierarchies (Q2303237) (← links)
- A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities (Q2351166) (← links)
- Extended decision procedure for a fragment of HL with binders (Q2351423) (← links)
- Polynomial hierarchy graph properties in hybrid logic (Q2453580) (← links)
- Undecidability of Multi-modal Hybrid Logics (Q2867946) (← links)
- Testing XML constraint satisfiability (Q2867947) (← links)
- A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders (Q3010363) (← links)
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957) (← links)
- Complexity and Succinctness Issues for Linear-Time Hybrid Logics (Q3532457) (← links)
- Terminating Tableau Calculi for Hybrid Logics Extending K (Q4982112) (← links)
- (Q5015266) (← links)
- A Logical Approach to Hamiltonian Graphs (Q5178965) (← links)
- Modal logics and local quantifiers: a zoo in the elementary hierarchy (Q6181934) (← links)