Decidability of the Guarded Fragment with the Transitive Closure

Authors:
Jakub Michaliszyn
Affiliations:
Institute of Computer Science, University of Wroclaw, Wroclaw, Poland 50-383
Venue:
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Year:
2009

Citing 5
Cited 2

Undecidability Results on Two-Variable Logics

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Guarded Fixed Point Logic

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
Propositional modal logic of programs

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
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

Two-Variable First-Order Logic with Equivalence Closure

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Decidable Elementary Modal Logics

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider an extension of the guarded fragment in which one can guard quantifiers using the transitive closure of some binary relations. The obtained logic captures the guarded fragment with transitive guards, and in fact extends its expressive power non-trivially, preserving the complexity: we prove that its satisfiability problem is 2Exptime -complete.