I-Peng Lin

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Cheng-Chia Chen

> Home > Persons > I-Peng Lin

Publications

1994
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/ChenL94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ChenL94
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]
- view
  authority control:
- export record
  dblp key:
  - conf/lfcs/ChenL94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lfcs/ChenL94
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]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/ChenL93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ChenL93
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)

a service of

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.