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

• Authors:

• Cheng-Chia Chen;I.-Peng Lin

• Affiliations:

• -;-

• Venue:
• Information Processing Letters
• Year:
• 1993