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

From MaRDI portal
Publication:1209339