Skip to main content
Conference Proceedings

Bounded-variable fragments of hybrid logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4393 LNCS 561-572
DOI: 10.1007/978-3-540-70918-3_48
18Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is undecidable and model checking is PSPACE-hard. It is shown here that on the linear frame (ω,

Cite

CITATION STYLE

APA

Schwentick, T., & Weber, V. (2007). Bounded-variable fragments of hybrid logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4393 LNCS, pp. 561–572). Springer Verlag. https://doi.org/10.1007/978-3-540-70918-3_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free