Games and model checking for guarded logics

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

Volumn 2250, Issue , 2001, Pages 70-84

  Berwanger, Dietmar ^a   Grädel, Erich ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CALCULATIONS; TEMPORAL LOGIC;

ALGORITHMIC SOLUTIONS; FIRST ORDER; FIXED-POINT LOGIC; MODAL MU CALCULUS; MODEL CHECKING PROBLEM;

MODEL CHECKING;

EID: 84880275878     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_5     Document Type: Conference Paper

References (22)

1. H. ANDRÉKA, J. VAN BENTHEM, AND I. NÉMETI, Modal languages and bounded fragments of predicate logic, Journal of Philosophical Logic, 27(1998), 217-274.
2. D. BERWANGER, Games and model checking for guarded logics. Diploma thesis, RWTH Aachen, 2000.
3. R. BLOEM, H. GABOW, AND F. SOMENZI, An algorithm for strongly connected component analysis in nlogn symbolic steps, in Formal Methods in Computer Aided Design, LNCS Nr. 1954(2000), 37-54.
4. S. DZIEMBOWSKI, Bounded-variable fixpoint queries are PSPACE-complete, Computer Science Logic CSL 96. LNCS Nr. 1258(1996), 89-105.
5. A. EMERSON AND C. JUTLA, Tree automata, mu-calculus and determinacy, in Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991, 368-377.
6. A. EMERSON AND C. JUTLA AND A. P. SISTLA, On model checking for the μ-calculus and its fragments, Theoretical Computer Science 258(2001), 491-522.
7. J. FLUM, M. FRICK, AND M. GROHE, Query evaluation via tree-decompositions, in Database Theory-ICDT 2001, LNCS Nr. 1973(2001), 22-38.
8. H. GANZINGER, C. MEYER, AND M. VEANES, The two-variable guarded fragment with transitive relations, in Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, 24-34.
9. G. GOTTLOB, E. GRÄDEL, AND H. VEITH, Datalog LITE: A deductive query language with linear time model checking, ACM Transactions on Computational Logic, (to appear).
10. G. GOTTLOB, N. LEONE, AND F. SCARCELLO, Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width, in Proc. 20th ACM Symp. on Principles of Database Systems, 2001, 195-201.
11. E. GRÄDEL, On the restraining power of guards, Journal of Symbolic Logic, 64(1999), 1719-1742.
12. E. GRÄDEL, Guarded fixed point logics and the monadic theory of countable trees, to appear in Theoretical Computer Science, (2001).
13. E. GRÄDEL, Why are modal logics so robustly decidable?, in Current Trends in Theoretical Computer Science. Entering the 21st Century, G. Paun, G. Rozenberg, and A. Salomaa, eds., World Scientific, 2001, 393-498.
14. E. GRÄDEL AND M. OTTO, On logics with two variables, Theoretical Computer Science, 224(1999), 73-113.
15. E. GRÄDEL AND I. WALUKIEWICZ, Guarded fixed point logic, in Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, 45-54.
16. B. HERWIG, Zur Modelltheorie von Lμ. Dissertation, Universität Freiburg, 1989.
17. M. JURDZINSKI, Deciding the winner in parity games is in UP ∩ Co-UP., Information Processing Letters, 68(1998), 119-124.
18. M. JURDZINSKI, Small progress measures for solving parity games, Proceedings of STACS 2000, LNCS Nr. 1770(2000), 290-301.
19. V. KING, O. KUPFERMAN, AND M. VARDI, On the complexity of parity word automata, in Proceedings of FOSSACS 2001, LNCS Nr. 2030(2001), 276-286.
20. O. KUPFERMAN, M. VARDI, AND P. WOLPER, An automata-theoretic approach to branching-time model checking, Journal of the ACM, 47(2000), 312-360.
21. C. STIRLING, Bisimulation, model checking and other games. Notes for the Mathfit instructional meeting on games and computation. Edinburgh, 1997.
22. M. VARDI, On the complexity of bounded-variable queries, in Proc. 14th ACM Symp. on Principles of Database Systems, 1995, 266-267.