Reachability logic: an efficient fragment of transitive closure logic (Q4487265): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2069044506 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:28, 19 March 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