The complexity of hybrid logics over equivalence relations

DOI10.1007/s10849-009-9089-6zbMath1193.03054OpenAlexW1968075259MaRDI QIDQ1047797

Thomas Schneider, Martin Mundhenk

Publication date: 6 January 2010

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-009-9089-6

zbMATH Keywords

computational complexityhybrid logicmodel checkingsatisfiabilitydownarrow operator

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Combined logics (03B62)

Related Items (2)

The complexity of satisfiability for fragments of hybrid logic. I. ⋮ Unnamed Item

Cites Work

• Domino-tiling games
• Hybrid languages
• Hierarchies of modal and temporal logics with reference pointers
• Model checking hybrid logics (with an application to semistructured data)
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The computational complexity of hybrid temporal logics
• Computer Science Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of hybrid logics over equivalence relations