Model checking hybrid logics (with an application to semistructured data)

DOI10.1016/j.jal.2005.06.010zbMath1100.68065OpenAlexW2144726625MaRDI QIDQ2506828

Massimo Franceschet, Maarten de Rijke

Publication date: 10 October 2006

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2005.06.010

zbMATH Keywords

model checkingsemistructured datamodal logicshybrid logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Temporal logic (03B44)

Related Items (20)

Logic of visibility in social networks ⋮ Complexity of hybrid logics over transitive frames ⋮ Complexity and Succinctness Issues for Linear-Time Hybrid Logics ⋮ The expressibility of fragments of hybrid graph logic on finite digraphs ⋮ A study on multi-dimensional products of graphs and hybrid logics ⋮ On model checking multiple hybrid views ⋮ Hybrid and First-Order Complete Extensions of CaRet ⋮ A BISIMULATION CHARACTERIZATION THEOREM FOR HYBRID LOGIC WITH THE CURRENT-STATE BINDER ⋮ Model checking memoryful linear-time logics over one-counter automata ⋮ A Logical Approach to Hamiltonian Graphs ⋮ Model Checking Strategic Equilibria ⋮ Complexity of Decision Problems for Mixed and Modal Specifications ⋮ Model checking for hybrid branching-time logics ⋮ Polyadic dynamic logics for HPSG parsing ⋮ Hybrid Specification of Reactive Systems: An Institutional Approach ⋮ 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 ⋮ On finite-state approximants for probabilistic computation tree logic

Uses Software

• XPath
• HyLoRes
• Lorel
• Lore

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An essay in combinatory dynamic logic
• Regular path queries with constraints
• Integrity constraints for XML
• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• Model-checking based data retrieval. An application to semistructured and temporal data.
• Hybrid languages
• Hierarchies of modal and temporal logics with reference pointers
• On the Unusual Effectiveness of Logic in Computer Science
• Hybrid logics: characterization, interpolation and complexity
• Interpolation for extended modal languages
• Representing and reasoning on XML documents: a description logic approach
• The computational complexity of hybrid temporal logics
• A Modal Perspective on Path Constraints
• Containment and equivalence for a fragment of XPath
• An approach to tense logic¹

This page was built for publication: Model checking hybrid logics (with an application to semistructured data)