![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
I-Peng Lin
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [c12]Kai-Wen Liu, I-Peng Lin, Shih-Wei Sun
, Wen-Huang Cheng, Xiaoniu Su-Chu Hsu:
G-spacing: a gyro sensor based relative 3D space positioning scheme. SIGGRAPH Posters 2015: 35:1
1990 – 1999
- 1997
- [c11]Jichang Tan, I-Peng Lin:
Recursive Modes for Precise Analysis of Logic Programs. ILPS 1997: 277-290 - 1996
- [c10]Jichang Tan, I-Peng Lin:
Type Synthesis for Logic Programs. JICSLP 1996: 200-214 - 1995
- [c9]Jichang Tan, I-Peng Lin:
Type Synthesis for Logic Programs. ICLP 1995: 823 - 1994
- [j5]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) - [c8]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 - 1993
- [j4]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
- [c7]Hsiu-Hui Lee, I-Peng Lin, Chien-Ping Wu:
Temporal Constraints and Their Interpretations in Natural Language. ICTAI 1992: 301-305 - [c6]Jichang Tan, I-Peng Lin:
Compiling Dataflow Analysis of Logic Programs. PLDI 1992: 106-115 - 1990
- [c5]Hsiu-Hui Lee, I-Peng Lin, Chien-Ping Wu:
A Logic-based Temporal Knowledge Representation in Mandarin Chinese. ROCLING 1990: 237-252
1980 – 1989
- 1989
- [j3]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) - [c4]Ka-Wai Chui, Yia-Ping Lin, Shuanfan Huang, I-Peng Lin:
NTUMT Strategy for Prepositional Phrase Attachment. ROCLING 1989: 163-186 - 1988
- [j2]Hsin-Hsi Chen
, I-Peng Lin, Chien-Ping Wu:
A Logical Approach to Movement Transformations in Mandarin Chinese. Int. J. Pattern Recognit. Artif. Intell. 2(1): 71-86 (1988) - [c3]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 - [c2]I-Peng Lin, Shuanfan Huang, Hsin-Hsi Chen, Ka-Wai Chui:
The Parsing Environment for Mandarin Syntax. ROCLING 1988: 211-214 - 1986
- [c1]Hsin-Hsi Chen, I-Peng Lin, Chien-Ping Wu:
A Logic Programming Approach to Frame-Based Language Design. FJCC 1986: 223-228 - 1985
- [j1]I-Peng Lin, Ching-Chi Hsu:
On Properties of Extended LL(k) Grammars. J. Inf. Sci. Eng. 1(1): 73-81 (1985)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint