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

DOI10.1016/J.JAL.2005.06.010MaRDI QIDQ2506828zbMATH OpenOpenAlexFDO

Authors 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 checkingmodal logicshybrid logicssemistructured data

Mathematics Subject Classification ID

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

Recommendations

• Model checking for hybrid branching-time logics
• Model checking for hybrid logic
• Computer Science Logic
• Applying model-checking to solve queries on semistructured data
• The complexity of hybrid logics over equivalence relations

Cites work

• scientific article; zbMATH DE number 1215461 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• scientific article; zbMATH DE number 1798186 (Why is no real title available?)
• scientific article; zbMATH DE number 2090297 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 1424043 (Why is no real title available?)
• scientific article; zbMATH DE number 3271460 (Why is no real title available?)
• A Modal Perspective on Path Constraints
• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• An approach to tense logic¹
• An essay in combinatory dynamic logic
• Containment and equivalence for a fragment of XPath
• Hierarchies of modal and temporal logics with reference pointers
• Hybrid languages
• Hybrid logics: Characterization, interpolation and complexity
• Integrity constraints for XML
• Interpolation for extended modal languages
• Modal logic
• Model checking.
• Model-checking based data retrieval. An application to semistructured and temporal data.
• On the unusual effectiveness of logic in computer science
• Regular path queries with constraints
• Representing and reasoning on XML documents: a description logic approach
• The computational complexity of hybrid temporal logics

Cited in

(26)

• scientific article; zbMATH DE number 2163033 (Why is no real title available?)
• Model checking memoryful linear-time logics over one-counter automata
• Model Checking Strategic Equilibria
• Model-checking based data retrieval. An application to semistructured and temporal data.
• Applying model-checking to solve queries on semistructured data
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• Logic of visibility in social networks
• Hybrid specification of reactive systems: an institutional approach
• The expressibility of fragments of hybrid graph logic on finite digraphs
• Polyadic dynamic logics for HPSG parsing
• Linking semantic models to support \(\mathrm{CSP} \parallel \mathrm{B}\) consistency checking
• On finite-state approximants for probabilistic computation tree logic
• Complexity of Decision Problems for Mixed and Modal Specifications
• Hybrid and first-order complete extensions of CaRet
• On model checking multiple hybrid views
• Complexity of hybrid logics over transitive frames
• A study on multi-dimensional products of graphs and hybrid logics
• A first step towards modeling semistructured data in hybrid multimodal logic
• Branching-time logics repeatedly referring to states
• The complexity of hybrid logics over equivalence relations
• Complexity and succinctness issues for linear-time hybrid logics
• Model checking for hybrid logic
• Visibility and exploitation in social networks
• A Logical Approach to Hamiltonian Graphs
• A BISIMULATION CHARACTERIZATION THEOREM FOR HYBRID LOGIC WITH THE CURRENT-STATE BINDER
• Model checking for hybrid branching-time logics

Describes a project that uses

Uses Software

• Lore
• Lorel
• HyLoRes
• XPath

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

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