Reachability logic: an efficient fragment of transitive closure logic (Q4487265): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:57, 7 February 2024
scientific article; zbMATH DE number 1463113
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
