| 1997 |
|---|
| 12 | | Jichang Tan,
I-Peng Lin:
Recursive Modes for Precise Analysis of Logic Programs.
ILPS 1997: 277-290 |
| 1996 |
|---|
| 11 | | Jichang Tan,
I-Peng Lin:
Type Synthesis for Logic Programs.
JICSLP 1996: 200-214 |
| 1995 |
|---|
| 10 | | Jichang Tan,
I-Peng Lin:
Type Synthesis for Logic Programs.
ICLP 1995: 823 |
| 1994 |
|---|
| 9 | | Cheng-Chia Chen,
I-Peng Lin:
The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal Theories.
LFCS 1994: 69-80 |
| 8 | | Cheng-Chia Chen,
I-Peng Lin:
The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics.
Theor. Comput. Sci. 129(1): 95-121 (1994) |
| 1993 |
|---|
| 7 | | Cheng-Chia Chen,
I-Peng Lin:
The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic.
Inf. Process. Lett. 45(3): 131-136 (1993) |
| 1992 |
|---|
| 6 | | Hsiu-Hui Lee,
I-Peng Lin,
Chien-Ping Wu:
Temporal Constraints and Their Interpretations in Natural Language.
ICTAI 1992: 301-305 |
| 5 | | Jichang Tan,
I-Peng Lin:
Compiling Dataflow Analysis of Logic Programs.
PLDI 1992: 106-115 |
| 1989 |
|---|
| 4 | EE | Ka-Wai Chui,
Yia-Ping Lin,
Shuanfan Huang,
I-Peng Lin:
NTUMT Strategy for Prepositional-Phrase Attachment.
J. Inf. Sci. Eng. 5(4): 449-460 (1989) |
| 1988 |
|---|
| 3 | | Hsin-Hsi Chen,
I-Peng Lin,
Chien-Ping Wu:
A new design of Prolog-based bottom-up parsing system with government-binding theory.
COLING 1988: 112-116 |
| 1986 |
|---|
| 2 | | Hsin-Hsi Chen,
I-Peng Lin,
Chien-Ping Wu:
A Logic Programming Approach to Frame-Based Language Design.
FJCC 1986: 223-228 |
| 1985 |
|---|
| 1 | EE | I-Peng Lin,
Ching-Chi Hsu:
On Properties of Extended LL(k) Grammars.
J. Inf. Sci. Eng. 1(1): 73-81 (1985) |
