The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic. - Cheng-Chia Chen; I-Peng Lin (Inf. Process. Lett., 1993)

The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal Theories. - Cheng-Chia Chen; I-Peng Lin (LFCS, 1994)

The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics. - Cheng-Chia Chen; I-Peng Lin (Theor. Comput. Sci., 1994)

User Pluggable Animation Components in Multi-user Virtual Environment. - Yu-Lin Chu; Tsai-Yen Li; Cheng-Chia Chen (Int. J. Virtual Real., 2008)