The two-variable guarded fragment with transitive guards is 2EXPTIME-hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2620, Issue , 2003, Pages 299-312

  Kieroński, Emanuel ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

GUARDED FRAGMENT; LOWER BOUNDS; SATISFIABILITY PROBLEMS; TRANSITIVE RELATION; TWO-VARIABLE GUARDED FRAGMENT; UPPER BOUND;

FORMAL LOGIC;

EID: 35248834125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_19     Document Type: Article

References (18)

1. H. Andréka, J. van Benthem, I. Németi. Modal Languages and Bounded Fragments of Predicate Logic. Journal of Philosophical Logic, 27, pages 217-274, 1998.
2. J. Balcázar, J. Diaz, J. Gabarró. Structural Complexity II. Springer 1990.
3. A. Chandra, D. Kozen, L. Stockmeyer. Alternation. Journal of the ACM, 28 (1), pages 114-133, 1981
4. H. Ganzinger, C. Meyer, M. Veanes. The Two-Variable Guarded Fragment with Transitive Relations. Proc. of 14-th IEEE Symp. on Logic in Computer Science (LICS), pages 24-34, 1999.
5. E. Grädel. On the Restraining Power of Guards. Journal of Symbolic Logic 64:1719-1742, 1999.
6. E. Grädel, M. Otto, E. Rosen. Undecidability Results on Two-Variable First-Order Logic. Bulletin of Symbolic Logic, 3(1), pages 53-69, 1997.
7. E. Grädel, P. Kolaitis, M. Vardi. On the Decision Problem for Two-Variable First Order Logic. Bulletin of Symbolic Logic, 3(1), pages 53-96, 1997.
8. E. Grädel, I. Walukiewicz. Guarded Fixpoint Logic. Proc. of 14-th IEEE Symp. on Logic in Computer Science (LICS), pages 45-54, 1999.
9. E. Kieroński. EXPSPACE-Complete Variant of Guarded Fragment with Transitivity. Proc. of 19-th International Symposium on Theoretical Aspects of Computer Science (STACS), pages 608-619, 2002.
10. D. Kozen. Results on the Prepositional μ-Calculus. Theoretical Computer Science 27, pages 333-354, 1983.
11. O. Kupferman, A. Pnueli. Once and For All. Proc. of 10-th IEEE Symp. on Logic in Computer Science (LICS), pages 25-35, 1995.
12. H. R. Lewis. Complexity Results for Classes of Quantificational Formulas. Journal of Computer and System Sciences, 21, pages 317-353, 1980.
13. G. De Giacomo, F. Masacci. Tableaux and Algorithms for Prepositional Dynamic Logic with Converse. Proc. of 13-th Int. Conf. on Automated Deduction (CADE), pages 613-627, 1996.
14. M. Mortimer. On Languages with Two Variables. Zeitschr. f. Logik und Grundlagen d. Math., 21, pages 135-140, 1975.
15. V. R. Pratt. Models of Program Logics. Proc. of 20-th Annual Symposium on Foundations of Computer Science (FOCS), pages 115-122, 1979.
16. M. O. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society, 141, pages 1-35, 1969.
17. W. Szwast, L. Tendera. On the Decision Problem for the Guarded Fragment with Transitivity. Proc. of 16-th IEEE Symp. on Logic in Computer Science (LICS), pages 147-156, 2001.
18. M. Y. Vardi. Reasoning about The Past with Two-Way Automata. Proc. of 25-th International Colloquium on Automata, Languages, and Programming (ICALP), pages 628-641, 1998.