✦ LIBER ✦
The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
✍ Scribed by Cheng-Chia Chen; I-Peng Lin
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 627 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.