PSPACE bounds for rank-1 modal logics

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 231-240

  Schröder, Lutz ^a   Pattinson, Dirk ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC METHODS; AXIOMATIZATION; MODAL LOGICS;

ALGORITHMS; BINARY SEQUENCES; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; MODAL ANALYSIS; SEMANTICS;

FORMAL LOGIC;

EID: 34547271085     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.44     Document Type: Conference Paper

References (36)

1. M. Barr. Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci., 114:299-315, 1993.
2. F. Bartels. Generalised coinduction. Math. Struct. Comput. Sci., 13:321-348, 2003.
3. F. Bartels, A. Sokolova, and E. de Vink. A hierarchy of probabilistic system types. In Coalgebraic Methods in Computer Science, volume 82 of ENTCS. Elsevier, 2003.
4. P. Blackburn, M. de Rijke, and Y Venema. Modal Logic. Cambridge, 2001.
5. R. Book, T. Long, and A. Selman. Quantitative relativizations of complexity classes. SIAM J. Computing, 13:461-487, 1984.
6. J. W. Carlyle and A. Paz. Realizations by stochastic finite automata. J. Comput. System Sci., 5:26-40, 1971.
7. B. Chellas. Modal Logic. Cambridge, 1980.
8. C. Cîrstea and D. Pattinson. Modular construction of modal logics. In Concurrency Theory, volume 3170 of LNCS, pages 258-275. Springer, 2004.
9. G. D'Agostino and A. Visser. Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic, 41:267-298, 2002.
10. H. De Nivelle, R. A. Schmidt, and U. Hustadt. Resolution-based methods for modal logics. Logic J. IGPL, 8:265-292, 2000.
11. J. Halpern and L. C. Rêgo. Closing the NP-PSPACE gap in the satisfiability problem for modal logic. Available on arXiv, http://arxiv.org/ abs/cs/0603019, 2006.
12. H. H. Hansen and C. Kupke. A coalgebraic perspective on monotone modal logic. In Coalgebraic Methods in Computer Science, volume 106 of ENTCS, pages 121-143. Elsevier, 2004.
13. A. Heifetz and P. Mongin. Probabilistic logic for type spaces. Games and Economic Behavior, 35:31-53, 2001.
14. B. Jacobs. Towards a duality result in the modal logic of coalgebras. In Coalgebraic Methods in Computer Science, volume 33 of ENTCS. Elsevier, 2000.
15. C. Kupke, A. Kurz, and D. Pattinson. Ultrafilter extensions for coalgebras. In Algebra and Coalgebra in Computer Science, volume 3629 of LNCS, pages 263-277. Springer, 2005.
16. A. Kurz. Specifying coalgebras with modal logic. Theoret. Comput. Sci., 260:119-138, 2001.
17. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Inform. Comput., 94:1-28, 1991.
18. T. Mossakowski, L. Schröder, M. Roggenbach, and H. Reichel Algebraic-coalgebraic specification in COCASL. J. Logic Algebraic Programming, 67:146-197, 2006.
19. H. J. Ohlbach and J. Koehler. Modal logics, description logics and arithmetic reasoning. Artif. Intell., 109:1-31, 1999.
20. D. Pattinson. Semantical principles in the modal logic of coalgebras. In Symposium on Theoretical Aspects of Computer Science, volume 2010 of LNCS, pages 514-526. Springer, 2001.
21. D. Pattinson. Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci., 309:177-193, 2003.
22. D. Pattinson. Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Logic, 45:19-33, 2004.
23. M. Pauly. A modal logic for coalitional power in games. J. Logic Comput., 12:149-166, 2002.
24. M. Rabin. Probabilistic automata. Inform. Control, 6:220-245, 1963.
25. M. Rößiger. Coalgebras and modal logic. In Coalgebraic Methods in Computer Science, volume 33 of ENTCS. Elsevier, 2000.
26. J. Rothe, H. Tews, and B. Jacobs. The Coalgebraic Class Specification Language CCSL. J. Universal Comput. Sci., 7:175-193, 2001.
27. J. Rutten. Universal coalgebra: A theory of systems. Theoret. Comput. Sci., 249:3-80, 2000.
28. A. Schrijver. Theory of linear and integer programming. Wiley Interscience, 1986.
29. L. Schröder. Expressivity of coalgebraic modal logic: the limits and beyond. In Foundations of Software Science And Computation Structures, volume 3441 of LNCS, pages 440-454. Springer, 2005.
30. L. Schröder. A finite model construction for coalgebraic modal logic. In L. Aceto and A. Ingólfsdóttir, editors, Foundations Of Software Science And Computation Structures, volume 3921 of LNCS, pages 157-171. Springer, 2006.
31. S. Tobies. PSPACE reasoning for graded modal logics. J. Logic Comput., 11:85-106, 2001.
32. D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Logic in Computer Science, pages 280-291. IEEE, 1997.
33. W. van der Hoek and J.-J. Meyer. Graded modalities in epistemic logic. In Logical foundations of computer science, volume 620 of LNCS, pages 503-514. Springer, 1992.
34. M. Vardi. On the complexity of epistemic reasoning. In Logic in Computer Science, pages 243-251. IEEE, 1989.
35. M. Y Vardi. Why is modal logic so robustly decidable? In Descriptive Complexity and Finite Models, volume 31 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 149-184. AMS, 1996.
36. Y Venema. Automata and fixed point logics: a coalgebraic perspective. Inform. Comput. To appear.