Efficient Temporal Satisfiability (Q4013255)
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: Efficient Temporal Satisfiability |
scientific article; zbMATH DE number 64026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Temporal Satisfiability |
scientific article; zbMATH DE number 64026 |
Statements
Efficient Temporal Satisfiability (English)
0 references
27 September 1992
0 references
\(P=NP\)
0 references
complexity of testing satisfiability
0 references
exponential time complexity
0 references
temporal logic
0 references
polynomial time complexity
0 references
Horn propositional logic
0 references
program synthesis
0 references
0 references
0.9136836
0 references
0 references
0.8989334
0 references
0.89854664
0 references
0.89791083
0 references
0.8968366
0 references
