The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic

Authors:
  • CCCheng-Chia Chen
    Cheng-Chia Chen
  • ILI-Peng Lin
    I-Peng Lin

Abstract
No abstract available

This publication has 5 references indexed in Scilit: