Computer Science Logic

DOI10.1007/11538363zbMath1136.03311OpenAlexW2479351976MaRDI 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

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)

Related Items (21)

The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I ⋮ On the freeze quantifier in Constraint LTL: Decidability and complexity ⋮ Modal logics and local quantifiers: a zoo in the elementary hierarchy ⋮ The complexity of satisfiability for fragments of hybrid logic. I. ⋮ Complexity of hybrid logics over transitive frames ⋮ Unnamed Item ⋮ Complexity and Succinctness Issues for Linear-Time Hybrid Logics ⋮ Polynomial hierarchy graph properties in hybrid logic ⋮ A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders ⋮ Hybrid logical analyses of the ambient calculus ⋮ Model checking memoryful linear-time logics over one-counter automata ⋮ A Logical Approach to Hamiltonian Graphs ⋮ A prover dealing with nominals, binders, transitivity and relation hierarchies ⋮ Terminating Tableau Calculi for Hybrid Logics Extending K ⋮ Complexity and succinctness issues for linear-time hybrid logics ⋮ The complexity of hybrid logics over equivalence relations ⋮ Branching-time logics repeatedly referring to states ⋮ Undecidability of Multi-modal Hybrid Logics ⋮ Testing XML constraint satisfiability ⋮ 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

This page was built for publication: Computer Science Logic