On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Theoretical Computer Science
A Road-Map on Complexity for Hybrid Logics
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Guarded Fragments with Constants
Journal of Logic, Language and Information
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
Undecidability of Multi-modal Hybrid Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Testing XML constraint satisfiability
Electronic Notes in Theoretical Computer Science (ENTCS)
A Decidable Temporal Logic of Repeating Values
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Complexity and Succinctness Issues for Linear-Time Hybrid Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Terminating Tableau Calculi for Hybrid Logics Extending K
Electronic Notes in Theoretical Computer Science (ENTCS)
A Logical Approach to Hamiltonian Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
The Complexity of Hybrid Logics over Equivalence Relations
Journal of Logic, Language and Information
Complexity and succinctness issues for linear-time hybrid logics
Theoretical Computer Science
Hybrid logical analyses of the ambient calculus
Information and Computation
Bounded-variable fragments of hybrid logics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A tableaux based decision procedure for a broad class of hybrid formulae with binders
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Narcissists are easy, stepmothers are hard
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Coalgebraic predicate logic: equipollence results and proof theory
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Journal of Automated Reasoning
A proof procedure for hybrid logic with binders, transitivity and relation hierarchies
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
Hybrid logic refers to a group of logics lying between modal and first-order logic in which one can refer to individual states of the Kripke structure. In particular, the hybrid logic HL(@, ↓ ) is an appealing extension of modal logic that allows one to refer to a state by means of the given names and to dynamically create new names for a state. Unfortunately, as for the richer first-order logic, satisfiability for the hybrid logic HL(@, ↓ ) is undecidable and model checking for HL(@, ↓ ) is PSpace-complete. We carefully analyze these results and we isolate large fragments of HL(@, ↓ ) for which satisfiability is decidable and model checking is below PSpace.