Model Checking Games
Open Access
- 1 October 2002
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 67, 15-34
- https://doi.org/10.1016/s1571-0661(04)80538-3
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Small Progress Measures for Solving Parity GamesPublished by Springer Nature ,2000
- On logics with two variablesTheoretical Computer Science, 1999
- Infinite games on finitely coloured graphs with applications to automata on infinite treesTheoretical Computer Science, 1998
- Bounded-variable fixpoint queries are PSPACE-completePublished by Springer Nature ,1997
- On the complexity of bounded-variable queries (extended abstract)Published by Association for Computing Machinery (ACM) ,1995
- On the synthesis of strategies in infinite gamesPublished by Springer Nature ,1995
- Unification as a complexity measure for logic programmingThe Journal of Logic Programming, 1987
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- The complexity of relational query languages (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982
- Borel DeterminacyAnnals of Mathematics, 1975