Structural complexity 2
Journal of the ACM (JACM)
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The Two-Variable Guarded Fragment with Transitive Relations
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
On the Decision Problem for the Guarded Fragment with Transitivity
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
On the complexity of the two-variable guarded fragment with transitive guards
Information and Computation
The two-variable guarded fragment with transitive guards is 2EXPTIME-hard
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Results on the guarded fragment with equivalence or transitive relations
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Complexity of two-variable logic on finite trees
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We introduce a new fragment GF2 + TG of the first order logic - the two-variable guarded fragment with one-way transitive guards. This logic corresponds in a natural way to temporal logics without past operators. We prove that the satisfiability problem for GF2+TG is EXPSPACE-complete. The lower bound, obtained for the monadic version of the considered logic without equality, improves NEXPTIME lower bound for the whole two-variable guarded fragment with transitive guards GF2 + TG, given by Szwast and Tendera [8].