The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics

Chen, Cheng-ChiaCheng-ChiaChenLin, I-PengI-PengLin2009-05-132018-07-052009-05-132018-07-051994http://ntur.lib.ntu.edu.tw//handle/246246/155702application/pdf2134200 bytesapplication/pdfen-USThe computational complexity of the satisfiability of modal Horn clauses for modal propositional logicsjournal articlehttp://ntur.lib.ntu.edu.tw/bitstream/246246/155702/1/06.pdf