scientific article; zbMATH DE number 1215461
From MaRDI portal
Publication:4215593
zbMath0911.03009MaRDI QIDQ4215593
Jerry Seligman, Patrick Blackburn
Publication date: 27 April 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilitymodal logicdecidabilitysatisfiability problemtense logicexpressivenesshybridisationhierarchy of hybrid languages
Related Items
Expressive power of ``now and ``then operators, The complexity of satisfiability for fragments of hybrid logic. I., Complexity of hybrid logics over transitive frames, Interval vs. Point Temporal Logic Model Checking, Complexity and Succinctness Issues for Linear-Time Hybrid Logics, Applying model-checking to solve queries on semistructured data, Model checking hybrid logics (with an application to semistructured data), Complexity and succinctness issues for linear-time hybrid logics, The complexity of hybrid logics over equivalence relations, Modal logic, truth, and the master modality., Higher-Order Syntax and Saturation Algorithms for Hybrid Logic, Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems