Back and forth between logic and games

Lectures in Game Theory for Computer Scientists

Volumn 9780521198660, Issue , 2011, Pages 99-145

  Grädel, Erich ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL LOGIC; GAME THEORY; MODEL CHECKING; SEMANTICS;

FIRST ORDER LOGIC; FIXED-POINT LOGIC; LOGICAL FORMULAS; LOGICAL REASONING; LOGICAL STATEMENTS; REACHABILITY; TWO-PLAYER GAMES; WINNING STRATEGY;

COMPUTER CIRCUITS;

EID: 80054679752     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511973468.005     Document Type: Chapter

References (28)

1. A. Arnold. The mu-calculus alternation-depth is strict on binary trees. RAIRO Informatique Théorique et Applications, 33:329–339, 1999.
2. J. Bradfield. The modal μ-calculus alternation hierarchy is strict. Theoretical Computer Science, 195:133–153, 1998.
3. A. Chandra and D. Harel. Structure and complexity for relational queries. Journal of Computer and System Sciences, 25:99–128, 1982.
4. E. Dahlhaus. Skolem normal forms concerning the least fixed point. In E. Börger, editor, Computation Theory and Logic, number 270 in Lecture Notes in Computer Science, pages 101–106. Springer Verlag, 1987.
5. A. Dawar and E. Grädel. The descriptive complexity of parity games. In Proceedings of 22th Annual Conference of the European Association for Computer Science Logic CSL 2008, pages 354–368, 2008.
6. A. Dawar, E. Grädel, and S. Kreutzer. Inflationary fixed points in modal logic. ACM Transactions on Computational Logic, 5:282–315, 2004.
7. A. Dawar, E. Grädel, and S. Kreutzer. Backtracking games and inflationary fixed points. Theoretical Computer Science, 350:174–187, 2006.
8. W. F. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 1(3):267–284, 1984.
9. S. Dziembowski. Bounded-variable fixpoint queries are PSPACE-complete. In 10th Annual Conference on Computer Science Logic CSL 96. Selected papers, Lecture Notes in Computer Science Nr. 1258, pages 89–105. Springer, 1996.
10. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 2nd edition, 1999.
11. A. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 368–377, 1991.
12. D. Fischer, E. Grädel, and L. Kaiser. Model checking games for the quantitative μ-calculus. Theory of Computing Systems, 2009.
13. E. Grädel. Finite Model Theory and Descriptive Complexity. In Finite Model Theory and Its Applications. Springer-Verlag, 2007.
14. E. Grädel and I. Walukiewicz. Positional determinacy of games with infinitely many priorities. Logical Methods in Computer Science, 2006.
15. E. Grädel, P. G. Kolaitis, L. Libkin, M. Marx, J. Spencer, M. Y. Vardi, Y. Venema, andS. Weinstein. Finite Model Theory and Its Applications. Springer, Berlin, 2007.
16. R. Greenlaw, J. Hoover, and W. Ruzzo. Limits to Parallel Computation. PCompleteness Theory. Oxford University Press, Oxford, 1995.
17. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.
18. A. Itai and J. Makowsky. Unification as a complexity measure for logic programming. Journal of Logic Programming, 4:105–117, 1987.
19. M. Jurdziński. Small progress measures for solving parity games. In Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS2000, Lecture Notes in Computer Science Nr. 1770, pages 290–301. Springer, 2000.
20. M. Jurdziński. Deciding the winner in parity games is in UP ∩ Co-UP. Information Processing Letters, 68:119–124, 1998.
21. M. Jurdziński, M. Paterson, and U. Zwick. A deterministic subexponential algorithm for solving parity games. In Proceedings of ACM-SIAM Proceedings on Discrete Algorithms, SODA 2006, pages 117–123, 2006.
22. S. Kreutzer. Expressive equivalence of least and inflationary fixed point logic. Annals of Pure and Applied Logic, 130:61–78, 2004.
23. D. Martin. Borel determinacy. Annals of Mathematics, 102:336–371, 1975.
24. A. Mostowski. Games with forbidden positions. Technical Report 78, University of Gdańsk, 1991.
25. M. Otto. Bisimulation-invariant Ptime and higher-dimensional mu-calculus. Theoretical Computer Science, 224:237–265, 1999.
26. th ACM Symposium on the Theory of Computing, pages 137–146, 1982.
27. E. Zermelo. über eine Anwendung der Mengenlehre auf die Theorie des Schachpiels. In Proc. 5th Internat. Congr. Mathematicians, volume 2, pages 501–504, Cambridge, 1913.
28. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200:135–183, 1998.