Bounded-variable fragments of hybrid logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4393 LNCS, Issue , 2007, Pages 561-572

  Schwentick, Thomas ^a   Weber, Volker ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; MODAL ANALYSIS; MODEL CHECKING; POLYNOMIALS; TIME DOMAIN ANALYSIS;

BOUNDED VARIABLE FRAGMENTS; MODAL LOGICS; POLYNOMIAL TIME MODEL CHECKING;

FUZZY LOGIC;

EID: 38049115650     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_48     Document Type: Conference Paper

References (25)

1. C. Areces, P. Blackburn, and M. Marx. A road-map on complexity for hybrid logics. In Proc. of 13th Computer Science Logic (CSL '99), volume 1683 of LNCS, pages 307-321. Springer, 1999.
2. C. Areces, P. Blackburn, and M. Marx. The computational complexity of hybrid temporal logics. Logic Journal of the IGPL, 8(5):653-679, 2000.
3. C. Areces, P. Blackburn, and M. Marx. Hybrid logics: Characterization, interpolation and complexity. Journal of Symbolic Logic, 66(3):977-1010, 2001.
4. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. of 32nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 368-377. IEEE, 1991.
5. M. Franceschet and M. de Rijke. Model checking hybrid logics (with an application to semistructured data). Journal of Applied Logic, 2005.
6. M. Franceschet, M. de Rijke, and B.-H. Schlingloff. Hybrid logics on linear structures: Expressivity and complexity. In 10th TIME / 4th ICTL, pages 192-202. IEEE Computer Society, 2003.
7. D. M. Gabbay. The declarative past and imperative future: Executable temporal logic for interactive systems. In Proc. of Temporal Logic in Specification 1987, volume 398 of LNCS, pages 409-448. Springer, 1989.
8. D. M. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal basis of fairness. In Conference Record of the 7th Annual ACM Symposium on Principles of Programming Languages (POPL'80), pages 163-173. ACM Press, 1980.
9. N. Globerman and D. Harel. Complexity results for two-way and multi-pebble automata and their logics. Theoretical Computer Science, 169(2):161-184, 1996.
10. P. Goralčik, A. Goralčiková, and V. Koubek. Alternation with a pebble. Information Processing Letters, 38(1):7-13, 1991.
11. T. Jiang and B. Ravikumar. A note on the space complexity of some desicion problems for finite automata. Information Processing Letters, 40:25-31, 1991.
12. H. Kamp. Tense logic and the Theory of Linear Order. PhD thesis, University of California Los Angeles, 1968.
13. O. Kupferman, N. Piterman, and M. Y. Vardi. Extended temporal logic revisited. In CONCUR 2001, volume 2154 of LNCS, pages 519-535. Springer, 2001.
14. A. W. Mostowski. Games with forbidden positions. Technical report, Uniwersytet Gdanski, Instytut Matematyki, 1991.
15. M. Mundhenk, T. Schneider, T. Schwentick, and V. Weber. Complexity of hybrid logics over transitive frames. In Proc. of M4M-4, volume 194 of Informatik-Berichte, pages 62-78. Humbold-Universität Berlin, 2005.
16. U. Sattler and M. Y. Vardi. The hybrid μ-calculus. In Proc. of IJCAR 2001, volume 2083 of LNCS, pages 76-91. Springer, 2001.
17. L. J. Stockmeyer. The complexity of decision problems in automata theory and logic. PhD thesis, MIT, 1974.
18. B. ten Cate and M. Franceschet. On the complexity of hybrid logics with binders. In Proc. of 19th Computer Science Logic (CSL 2005), volume 3634 of LNCS, pages 339-354. Springer, 2005.
19. van Emde Boas. The convenience of tilings. In Complexity, Logic, and Recursion Theory, volume 187 of Lecture Notes in Pure and Applied Mathematics, pages 331-363. Marcel Dekker, Inc., 1997.
20. M. Y. Vardi. Nontraditional applications of automata theory. In Proc. of Theoretical Aspects of Computer Software (TACS '94), volume 789 of LNCS, pages 575-597. Springer, 1994.
21. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, volume 1043 of LNCS, pages 238-266. Springer, 1996.
22. M. Y. Vardi. Reasoning about the past with two-way automata. In Proc. of ICALP'98, volume 1443 of LNCS, pages 628-641. Springer, 1998.
23. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 1994.
24. P. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning about infinite computation paths (extended abstract). In 24th Annual Symposium on Foundations of Computer Science (FOCS), pages 185-194. IEEE, 1983.
25. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata and infinite trees. Theoretical Computer Science, 200:135-183, 1998.