Computational complexity of a core fragment of Halpern-Shoham logic (Q5079792)
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: Computational complexity of a core fragment of Halpern-Shoham logic |
scientific article; zbMATH DE number 7533386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of a core fragment of Halpern-Shoham logic |
scientific article; zbMATH DE number 7533386 |
Statements
28 May 2022
0 references
temporal logic
0 references
interval logic
0 references
computational complexity
0 references
hybrid logic
0 references
0.8726155161857605
0 references
0.8536749482154846
0 references
0.8351395726203918
0 references
0.8186009526252747
0 references
0.8090358972549438
0 references
