Once upon a time in the west: Determinacy, definability, and complexity of path games

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2850, Issue , 2003, Pages 229-243

  Berwanger, Dietmar ^a   Grädel, Erich ^a   Kreutzer, Stephan ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CALCULATIONS; FORMAL LOGIC; POLYNOMIAL APPROXIMATION; SET THEORY; TEMPORAL LOGIC; ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; MATHEMATICAL OPERATORS; PROBLEM SOLVING; STRATEGIC PLANNING; THEOREM PROVING; TOPOLOGY; TREES (MATHEMATICS);

COMPLEXITY ISSUES; DESCRIPTIVE SET THEORY; FIRST ORDER LOGIC; INFINITE GRAPH; MODAL MU CALCULUS; POLYNOMIAL-TIME; POSITIONAL WINNING STRATEGY; WINNING CONDITIONS; BINARY TREE; CYCLIC PLANNING; TOPOLOGICAL PROPERTIES;

GRAPH THEORY; GAME THEORY;

EID: 9444258645     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39813-4_16     Document Type: Conference Paper

References (10)

1. S. Dziembowski, M. Jurdzi'nski, and I. Walukiewicz, How much memory is needed to win infinite games?, in Proceedings of 12th Annual IEEE Symposium on Logic in Computer Science (LICS 97), 1997, pp. 99-110.
2. E. Grädel, W. Thomas, and T. Wilke, eds., Automata, Logics, and Infinite Games, Lecture Notes in Computer Science Nr. 2500, Springer, 2002.
3. T. Hafer and W. Thomas, Computation tree logic CTL and path quantifiers in the monadic theory of the binary tree, in Automata, Languages and Programming, 14th International Colloquium, ICALP87, Lecture Notes in Computer Science Nr. 267, Springer, 1987, pp. 269-279.
4. D. Janin and I. Walukiewicz, On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic, in Proceedings of 7th International Conference on Concurrency Theory CONCUR '96, no. 1119 in Lecture Notes in Computer Science, Springer-Verlag, 1996, pp. 263-277.
5. A. Kanamori, The Higher Infinite, Springer, 1991.
6. A. Kechris, Classical Descriptive Set Theory, Springer, 1995.
7. R. Mauldin, ed., The Scottish Book. Mathematics from the Scottish Café, Birkhäuser, 1981.
8. F. Moller and A. Rabinovitch, Counting on CTL: On the expressive power of monadic path logic, Information and Computation, (2003). To appear.
9. M. Pistore and M. Vardi, The planning spectrum-one, two, three, infinity, in Proc. 18th IEEE Symp. on Logic in Computer Science, 2003.
10. W. Thomas, A combinatorial approach to the theory of omega-automata, Information and Control, 48 (1981), pp. 261-283.