The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Cheng-Chia Chen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Cheng-Chia Chen, I-Peng Lin
    The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:3, pp:131-136 [Journal]
  3. 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.001secs, Finished in 0.001secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002