公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
---|---|---|---|---|---|---|
1996 | A Case Study of Parallel Satisfiability on Quasigroup Problems | Zhang H.; Bonacina M. P.; Hsiang J. | Journal of Symbolic Computation | |||
1996 | A category theory approach to completion-based theorem proving strategies | Bonacina M. P.; J | Journal of Information Science and Engineering | |||
1994 | A Category-Theoretic Treatment of Automated Theorem Proving | Bonacina M. P.; Hsiang J. | Journal of Information Science and Engineering | |||
1995 | The Clause-Diffusion Methodology for Distributed Deduction | Bonacina M. P.; Hsiang J. | Fundamenta Informaticae | |||
1990 | Completion Procedures as Semi-Decision Procedures | Bonacina M. P.; Hsiang J. | proceedings of the 2nd International Conference on Conditional Term Rewriting Systems, Montreal, May 1990 | |||
1991 | Incompleteness of the RUE/NRF inference systems | Bonacina M. P.; Hsiang J. | Association of Automated Reasoning Newsletter | |||
1992 | On Rewrite Programs: Semantics and Relationship with Prolog | Bonacina M. P.; Hsiang J. | Journal of Logic Programming | |||
1998 | On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching | Bonacina M. P.; Hsiang J. | New Generation Computing | |||
1994 | On Subsumption in Distributed Deduction | Bonacina M. P.; Hsiang J. | Journal of Automated Deduction | |||
1996 | On the notion of complexity of search in theorem proving | Bonacina M. P.; Hsiang J. | Logic Colloqium 96', Association of Symbolic Logic Annual Meeting, Spain, July 1996 | |||
1997 | On the notion of complexity of search in theorem proving | Bonacina M. P.; Hsiang J. | Bulletin of Symbolic Logic | |||
1996 | On the Representation of Dynamic Search Spaces in Theorem Proving | Bonacina M. P.; Hsiang J. | International Conference on Artificial Intelligence, Kaohsiung, December 1996 | |||
1995 | Subsumption Revisited | Bonacina M. P.; Hsiang J. | Proceedings of Workshop on Artificial Intelligence |