Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394587zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1424043
• The complexity of hybrid logics over equivalence relations
• scientific article; zbMATH DE number 2090297
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• The complexity of satisfiability for fragments of hybrid logic. I.

Cited in

(37)

• Complexity and succinctness issues for linear-time hybrid logics
• Model checking for hybrid logic
• The complexity of hybrid logics over equivalence relations
• Branching-time logics repeatedly referring to states
• Observational interpretations of hybrid dynamic logic with binders and silent transitions
• A prover dealing with nominals, binders, transitivity and relation hierarchies
• Hierarchical hybrid logic
• 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
• Model checking hybrid logics (with an application to semistructured data)
• Hybrid logics: Characterization, interpolation and complexity
• Erratum to: ``Extension of a decision procedure for a fragment of hybrid logic with binders
• Undecidability of multi-modal hybrid logics
• Testing XML constraint satisfiability
• Narcissists are easy, stepmothers are hard
• A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders
• scientific article; zbMATH DE number 5840258 (Why is no real title available?)
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• A BISIMULATION CHARACTERIZATION THEOREM FOR HYBRID LOGIC WITH THE CURRENT-STATE BINDER
• Bounded-Variable Fragments of Hybrid Logics
• scientific article; zbMATH DE number 2090297 (Why is no real title available?)
• scientific article; zbMATH DE number 1424043 (Why is no real title available?)
• Terminating Tableau Calculi for Hybrid Logics Extending K
• Relation-changing logics as fragments of hybrid logics
• A Logical Approach to Hamiltonian Graphs
• Algebraization of Hybrid Logic with Binders
• Algorithmic correspondence for hybrid logic with binder
• 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
• Hybrid modal operators for definite descriptions
• Sahlqvist completeness theory for hybrid logic with downarrow binder
• 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

This page was built for publication: Computer Science Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394587)