|
English
|
正體中文
|
简体中文
|
Total items :2854037
|
|
Visitors :
45289976
Online Users :
1038
Project Commissioned by the Ministry of Education
Project Executed by National Taiwan University Library
|
|
|
|
Taiwan Academic Institutional Repository >
Browse by Author
|
"hsiang jieh"
Showing items 126-135 of 164 (17 Page(s) Totally)
<< < 8 9 10 11 12 13 14 15 16 17 > >>
View [10|25|50] records per page
| 國立臺灣大學 |
1991-06 |
Computing with Recurrence Domains
|
Chen, H.; 項潔; Chen, H.; Hsiang, Jieh |
| 國立臺灣大學 |
1991-06 |
High Performance Simplification-based Automatd Deduction
|
Bonacina, M. P.; 項潔; Bonacina, M. P.; Hsiang, Jieh |
| 國立臺灣大學 |
1991-06 |
On Fairness of Completion-based Theorem Proving Strategies
|
Bonacina, M. P.; 項潔; Bonacina, M. P.; Hsiang, Jieh |
| 國立臺灣大學 |
1991-04 |
Operational and Denotational Semantics of Rewrite Programs
|
Bonacina, M. P.; 項潔; Bonacina, M. P.; Hsiang, Jieh |
| 國立臺灣大學 |
1991 |
Proving Refutational Completeness of Theovem-Proving Strategies:The Transfinite Semantic Tree Method
|
Rusinowitch, M.; 項潔; Rusinowitch, M.; Hsiang, Jieh |
| 國立臺灣大學 |
1991 |
Simplification Orderings as a Basis for Automated Deduction
|
項潔; Hsiang, Jieh |
| 臺大學術典藏 |
1991 |
Proving Refutational Completeness of Theovem-Proving Strategies:The Transfinite Semantic Tree Method
|
Rusinowitch, M.; Hsiang, Jieh; Rusinowitch, M.; 項潔; Hsiang, Jieh |
| 臺大學術典藏 |
1991 |
Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method.
|
Rusinowitch, Micha?l; JIEH HSIANG; Hsiang, Jieh |
| 國立臺灣大學 |
1990-05 |
On Finite Representation of Infinite Terms
|
Chen, H.; 項潔; Kung, H. C.; Chen, H.; Hsiang, Jieh; Kung, H. C. |
| 國立臺灣大學 |
1990-05 |
SbReve:A Term Rewritiong Laboratory with Unfailing Completion
|
Anantharaman, S.; 項潔; Mzali, J.; Anantharaman, S.; Hsiang, Jieh; Mzali, J. |
Showing items 126-135 of 164 (17 Page(s) Totally)
<< < 8 9 10 11 12 13 14 15 16 17 > >>
View [10|25|50] records per page
|
