Abstract
Alternation was introduced in the late 1970s as a complexitytheoretic construct, capturing the computational aspect of games. Since then it has also been shown that alternation can be viewed as a powerful high level algorithmic construct, which is particularly suitable for automated reasoning. In this talk I will explain how to turn alternation from a complexity-theoretic construct to an algorithmic construct and demonstrate its applicability in the context of modal and temporal reasoning. A particular emphasis will be put on the use of alternating automata as an algorithmic tool.
Supported in part by NSF grants CCR-9988322, IIS-9908435, IIS-9978135, and EIA- 0086264, by BSF grant 9800096, and by a grant from the Intel Corporation. URL: http://www.cs.rice.edu/~vardi.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312–360, March 2000.
C. Stirling. Games and modal μ-calculus. In Proc. 13th Symp. on Theoretical Aspects of Computer Science, volume 1055 of Lecture Notes in Computer Science, pages 298–312. Springer-Verlag, 1996.
M.Y. Vardi. On the complexity of epistemic reasoning. In Proc. 4th IEEE Symp. on Logic in Computer Science, pages 243–252, Asilomar, June 1989.
M.Y. Vardi. Alternating automata-unifying truth and validity checking for temporal logics. In W. McCune, editor, Proc. 14th International Conference on Automated Deduction, volume 1249 of Lecture Notes in Artificial Intelligence, pages 191–206. Springer-Verlag, Berlin, july 1997.
T. Wilke. Alternating tree automata, parity games, and modal μ-calculus. Bull. Soc. Math. Belg., 8(2), May 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vardi, M.Y. (2002). Alternation. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_54
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44190-8
Online ISBN: 978-3-540-45757-2
eBook Packages: Springer Book Archive