Cheng-Chia Chen, I-Peng Lin The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal Theories. [Citation Graph (0, 0)][DBLP] LFCS, 1994, pp:69-80 [Conf]

Cheng-Chia Chen, I-Peng Lin The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:129, n:1, pp:95-121 [Journal]

Search in 0.002secs, Finished in 0.003secs

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP