The complexity of propositional linear temporal logics (Q3769957): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56619906, #quickstatements; #temporary_batch_1712201099914 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56619906 / rank | |||
Normal rank | |||
Revision as of 19:39, 4 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of propositional linear temporal logics |
scientific article |
Statements
The complexity of propositional linear temporal logics (English)
0 references
1985
0 references
branching time temporal logic
0 references
decision procedures
0 references
complexity
0 references
satisfiability
0 references
determination of truth
0 references
propositional linear temporal logics
0 references
NP-complete
0 references
PSPACE-complete
0 references
