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

Chen, Cheng-ChiaCheng-ChiaChenLin, I-PengI-PengLin2009-05-132018-07-052009-05-132018-07-051993http://ntur.lib.ntu.edu.tw//handle/246246/155693application/pdf642183 bytesapplication/pdfen-USThe computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logicjournal articlehttp://ntur.lib.ntu.edu.tw/bitstream/246246/155693/1/04.pdf