| 國立臺灣大學 |
1994 |
Towards a Foundation of Completion Procedures as Semidecision Procedures
|
Bonacina, M. P.; 項潔; Bonacina, M. P.; Hsiang, Jieh |
| 臺大學術典藏 |
1994 |
Towards a Foundation of Completion Procedures as Semidecision Procedures
|
Bonacina, M. P.; Hsiang, Jieh; Bonacina, M. P.; 項潔; Hsiang, Jieh |
| 國立臺灣大學 |
1993 |
On Subsumption in Distributed Deduction
|
Bonacina, M. P.; 項潔; Bonacina, M. P.; Hsiang, Jieh |
| 國立臺灣大學 |
1993 |
A System for Distributed Simplification-based Theorem Proving
|
Bonacina, M. P.; 項潔; Bonacina, M. P.; Hsiang, Jieh |
| 國立臺灣大學 |
1993 |
On Fairness in Distributed Automated Deduction
|
Bonacina, M. P.; 項潔; Bonacina, M. P.; Hsiang, Jieh |
| 國立臺灣大學 |
1992 |
Automated Proofs of the Moufang Identities in Alternative Rings
|
Anantharaman, S.; 項潔; Anantharaman, S.; Hsiang, Jieh |
| 國立臺灣大學 |
1992 |
Automated Theorem Proving in the Presence of Equalities
|
Kirchner, H.; Lescanne, P.; Rusinowitch, M.; 項潔; Kirchner, H.; Lescanne, P.; Rusinowitch, M.; Hsiang, Jieh |
| 國立臺灣大學 |
1992 |
Logic Programming with Recurrence Domains
|
Chen, H.; 項潔; Chen, H.; Hsiang, Jieh |
| 臺大學術典藏 |
1992 |
Automated Proofs of the Moufang Identities in Alternative Rings
|
Anantharaman, S.; Hsiang, Jieh; Anantharaman, S.; 項潔; Anantharaman, S.; Hsiang, Jieh |
| 國立臺灣大學 |
1991-07 |
A Category Theory Approach to Completion-based Theorem Proving Strategies
|
Bonacina, M. P.; 項潔; Bonacina, M. P.; Hsiang, Jieh |
| 國立臺灣大學 |
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-01 |
Rewrite Techniques in Theorem Proving
|
Bachmair, L.; 項潔 |
| 國立臺灣大學 |
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 |
| 國立臺灣大學 |
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. |
| 臺大學術典藏 |
1990-05 |
On Finite Representation of Infinite Terms
|
Chen, H.; Kung, H. C.; Hsiang, Jieh; Chen, H.; 項潔; Kung, H. C.; Hsiang, Jieh |
| 臺大學術典藏 |
1990-05 |
SbReve:A Term Rewritiong Laboratory with Unfailing Completion
|
Anantharaman, S.; Hsiang, Jieh; Mzali, J.; Anantharaman, S.; 項潔; Mzali, J.; Anantharaman, S.; Hsiang, Jieh; Mzali, J. |
| 國立臺灣大學 |
1990 |
Automatic Inductive Theorem Proving Using Prolog
|
Srivas, M. K.; 項潔; Srivas, M. K.; Hsiang, Jieh |
| 臺大學術典藏 |
1990 |
Automatic Inductive Theorem Proving Using Prolog
|
Srivas, M. K.; Hsiang, Jieh; Srivas, M. K.; 項潔; Srivas, M. K.; Hsiang, Jieh |
| 國立臺灣大學 |
1989-04 |
Complete Sets of Inference Rule for E-Unifications
|
項潔; Jouannaud, J. P.; Hsiang, Jieh; Jouannaud, J. P. |
