The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic (Q1209339)
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 satisfiability of temporal Horn formulas in propositional linear-time temporal logic |
scientific article; zbMATH DE number 167747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic |
scientific article; zbMATH DE number 167747 |
Statements
The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic (English)
0 references
16 May 1993
0 references
temporal logic programming
0 references
satisfiability
0 references
first-order logic
0 references
temporal logic
0 references
Horn formulas
0 references
0.94629216
0 references
0.93363434
0 references
0.93363434
0 references
0.93358254
0 references
0.9270261
0 references
0.9192629
0 references
0.9185845
0 references
