The complexity of linear-time temporal logic over the class of ordinals (Q3081444)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5862392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of linear-time temporal logic over the class of ordinals |
scientific article; zbMATH DE number 5862392 |
Statements
The complexity of linear-time temporal logic over the class of ordinals (English)
0 references
8 March 2011
0 references
linear-time temporal logic
0 references
ordinal
0 references
polynomial space
0 references
satisfiability problem
0 references
ordinal automaton
0 references
0.9693907499313354
0 references
0.878703773021698
0 references
0.8787036538124084
0 references
0.8369517922401428
0 references
0.8359753489494324
0 references
