Expspace-complete variant of guarded fragment with transitivity

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

Volumn 2285, Issue , 2002, Pages 608-619

  Kieroński, Emanuel ^a  

^a Institute of Computer Science University of Wroc aw   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FIRST ORDER LOGIC; GUARDED FRAGMENT; LOWER BOUNDS; SATISFIABILITY PROBLEMS; TWO-VARIABLE GUARDED FRAGMENT;

FORMAL LOGIC;

EID: 84905966872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_50     Document Type: Conference Paper

References (8)

1. H. Andréka, J. van Benthem, I. Németi, Modal Languages and Bounded Fragments of Predicate Logic, ILLC Research Report, 1996.Journal ver.: J. Philos. Logic, 27 (1998), No.3, 217-274.
2. J. Balćazar, J. Diaz, J. Gabarró, Structural Complexity II, Springer 1990.
3. A. Chandra, D. Kozen, L. Stockmeyer, Alternation, JACM, 28, No.1 (1981), pages 114-133.
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, 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, P. Kolaitis, M. Vardi, On the decision problem for two-variable first order logic, Bull.of Symbolic Logic, 3(1):53-96, 1997.
7. E. Grädel, I. Walukiewicz, Guarded Fixpoint Logic, Proc.of 14th IEEE Symp.on Logic in Computer Science, pages 45-54, 1999.
8. 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, pages 147-156, 2001.