Publication:4539599
From MaRDI portal
zbMath0988.03053MaRDI QIDQ4539599
Moshe Y. Vardi, Ulrike Sattler
Publication date: 10 July 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2083/20830076
68Q45: Formal languages and automata
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
03D15: Complexity of computation (including implicit computational complexity)
Related Items
Reasoning and Query Answering in Description Logics, Unnamed Item, Terminating Tableaux for Hybrid Logic with Eventualities, Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA, On the undecidability of logics with converse, nominals, recursion and counting, On model checking multiple hybrid views, Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics, Global view on reactivity: switch graphs and their logics, On the expressive power of hybrid branching-time logics, Model checking for hybrid branching-time logics, ExpTime tableaux with global caching for hybrid PDL, A goal-directed decision procedure for hybrid PDL, A logic of reachable patterns in linked data-structures, Clausal Tableaux for Hybrid PDL, Hilbert-Style Axiomatization for Hybrid XPath with Data, Modal Expressiveness of Graph Properties, On the Hybrid Extension of CTL and CTL +, Enriched μ–Calculus Pushdown Module Checking
