The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
Authors:
- Cheng-Chia ChenCCCheng-Chia Chen
- I-Peng LinILI-Peng Lin
- 8 March 1993
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 45 (3) , 131-136
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Clausal intuitionistic logic I. fixed-point semanticsThe Journal of Logic Programming, 1988
- A note on the complexity of the satisfiability of modal Horn clausesThe Journal of Logic Programming, 1987
- MOLOG: A system that extends PROLOG with modal logicNew Generation Computing, 1986
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM Journal on Computing, 1977