The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

I-Peng Lin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hsin-Hsi Chen, I-Peng Lin, Chien-Ping Wu
    A new design of Prolog-based bottom-up parsing system with government-binding theory. [Citation Graph (0, 0)][DBLP]
    COLING, 1988, pp:112-116 [Conf]
  2. Hsin-Hsi Chen, I-Peng Lin, Chien-Ping Wu
    A Logic Programming Approach to Frame-Based Language Design. [Citation Graph (0, 0)][DBLP]
    FJCC, 1986, pp:223-228 [Conf]
  3. Jichang Tan, I-Peng Lin
    Type Synthesis for Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1995, pp:823- [Conf]
  4. Jichang Tan, I-Peng Lin
    Type Synthesis for Logic Programs. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:200-214 [Conf]
  5. Hsiu-Hui Lee, I-Peng Lin, Chien-Ping Wu
    Temporal Constraints and Their Interpretations in Natural Language. [Citation Graph (0, 0)][DBLP]
    ICTAI, 1992, pp:301-305 [Conf]
  6. 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]
  7. Jichang Tan, I-Peng Lin
    Compiling Dataflow Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    PLDI, 1992, pp:106-115 [Conf]
  8. Jichang Tan, I-Peng Lin
    Recursive Modes for Precise Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ILPS, 1997, pp:277-290 [Conf]
  9. 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]
  10. Ka-Wai Chui, Yia-Ping Lin, Shuanfan Huang, I-Peng Lin
    NTUMT Strategy for Prepositional-Phrase Attachment. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 1989, v:5, n:4, pp:449-460 [Journal]
  11. I-Peng Lin, Ching-Chi Hsu
    On Properties of Extended LL(k) Grammars. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 1985, v:1, n:1, pp:73-81 [Journal]
  12. 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.016secs, Finished in 0.017secs
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