Computer Science Logic

DOI10.1007/11538363zbMath1136.03311MaRDI QIDQ5394587

Balder ten Cate, Massimo Franceschet

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03B45: Modal logic (including the logic of norms)

68Q60: Specification and verification (program logics, model checking, etc.)

03B25: Decidability of theories and sets of sentences

Related Items

Terminating Tableau Calculi for Hybrid Logics Extending K, A Logical Approach to Hamiltonian Graphs, The complexity of satisfiability for fragments of hybrid logic. I., Complexity of hybrid logics over transitive frames, On the freeze quantifier in Constraint LTL: Decidability and complexity, Hybrid logical analyses of the ambient calculus, Model checking memoryful linear-time logics over one-counter automata, Complexity and succinctness issues for linear-time hybrid logics, The complexity of hybrid logics over equivalence relations, Branching-time logics repeatedly referring to states, A prover dealing with nominals, binders, transitivity and relation hierarchies, A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities, Extended decision procedure for a fragment of HL with binders, Polynomial hierarchy graph properties in hybrid logic, Undecidability of Multi-modal Hybrid Logics, Testing XML constraint satisfiability, A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders, The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I, Complexity and Succinctness Issues for Linear-Time Hybrid Logics