Pages that link to "Item:Q4487265"
From MaRDI portal
The following pages link to Reachability logic: an efficient fragment of transitive closure logic (Q4487265):
Displaying 8 items.
- Size-estimation framework with applications to transitive closure and reachability (Q1384531) (← links)
- Quantified computation tree logic (Q1603537) (← links)
- Space-efficient fragments of higher-order fixpoint logic (Q1685775) (← links)
- Querying linguistic trees (Q2268350) (← links)
- Existential Label Flow Inference Via CFL Reachability (Q3613380) (← links)
- Foundations of RDF Databases (Q3638999) (← links)
- PDL for ordered trees (Q3647225) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)