Two-Way Alternating Automata and Finite Models-Reference-Cited by-同舟云学术

Two-Way Alternating Automata and Finite Models

Published:2002 Issue: Volume: Page:833-844
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Bojarńczyk Mikolaj

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45465-9_71

Reference16 articles.

1. Lect Notes Comput Sci;M. Bojańczyk,2001

2. A. Saoudi D. E. Muller and P. E. Shupp. Weak alternating automata give a simple explanation why most temporal and dynamic logics are decidable in exponential time. In Proceedings 3rd IEEE Symposium on Logic in Computer Science, pages 422–427, 1988.

3. E. A. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy. In Proc. 32th IEEE Symposium on Foundations of Computer Science, pages 368–377, 1991.

4. E. Grädel. On the restraining power of guards. Journal of Symbolic Logic, 1999.

5. E. Grädel and I. Walukiewicz. Guarded fixed point logic. In Proceedings 14th IEEE Symp. on Logic in Computer Science, pages 45–54, 1999.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Guarded Negation;Automata, Languages and Programming;2011

2. The complexity of finite model reasoning in description logics;Information and Computation;2005-05

3. On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity;Logic for Programming, Artificial Intelligence, and Reasoning;2005

4. A Bounding Quantifier;Computer Science Logic;2004

5. The Complexity of Finite Model Reasoning in Description Logics;Automated Deduction – CADE-19;2003