The Complexity of Generalized Satisfiability for Linear Temporal Logic (Q3623013): 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 / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2168/lmcs-5(1:1)2009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2951449870 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Generalized Satisfiability for Linear Temporal Logic |
scientific article |
Statements
The Complexity of Generalized Satisfiability for Linear Temporal Logic (English)
0 references
29 April 2009
0 references
linear temporal logic
0 references
complexity of satisfiability
0 references
PSPACE-complete
0 references
NP-complete
0 references
PTIME
0 references
