The computational complexity of hybrid temporal logics (Q4511543)
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: The computational complexity of hybrid temporal logics |
scientific article; zbMATH DE number 1523408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of hybrid temporal logics |
scientific article; zbMATH DE number 1523408 |
Statements
The computational complexity of hybrid temporal logics (English)
0 references
2 May 2001
0 references
hybrid logic
0 references
temporal logic
0 references
computational complexity
0 references
satisfiability problem
0 references
0.86714768409729
0 references
0.8427750468254089
0 references
0.8385798335075378
0 references
0.8263699412345886
0 references
