Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

ICALP
2009
Springer

favoriteEmaildiscussreport

101views Programming Languages» more ICALP 2009»

Decidability of the Guarded Fragment with the Transitive Closure

14 years 3 months ago

Decidability of the Guarded Fragment with the Transitive Closure

Download www.ii.uni.wroc.pl

We consider an extension of the guarded fragment in which one can guard quantiers 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 satisability problem is 2Exptimecomplete.

Jakub Michaliszyn

Real-time Traffic

Binary Relations | ICALP 2009 | Programming Languages | Transitive Closure | Transitive Guards |

claim paper

Related Content

» Deciding Termination of Query Evaluation in TransitiveClosure Logics for Constraint Databa...

» The Boundary Between Decidability and Undecidability for TransitiveClosure Logics

» A Decidable Fragment of Separation Logic

» On Role Logic

» Reachability Problems on Regular Ground Tree Rewriting Graphs

» Variable Automata over Infinite Alphabets

Post Info
More Details (n/a)

Added	25 Jul 2010
Updated	25 Jul 2010
Type	Conference
Year	2009
Where	ICALP
Authors	Jakub Michaliszyn

Comments (0)