Reachability logic: an efficient fragment of transitive closure logic (Q4487265)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reachability logic: an efficient fragment of transitive closure logic |
scientific article; zbMATH DE number 1463113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability logic: an efficient fragment of transitive closure logic |
scientific article; zbMATH DE number 1463113 |
Statements
Reachability logic: an efficient fragment of transitive closure logic (English)
0 references
14 November 2000
0 references
graph query languages
0 references
complexity of model checking
0 references
PDL
0 references
\(\text{CTL}^\star\)
0 references
reachability logic
0 references
0.7828211188316345
0 references
0.7653190493583679
0 references
0.7575797438621521
0 references
