Distributing Equational Theorem Proving
暂无分享,去创建一个
[1] Robert A. Meyer,et al. DARES: A Distributed Automated REasoning System , 1990, AAAI.
[2] Nachum Dershowitz,et al. Orderings for Equational Proofs , 1986, LICS.
[3] Wolfgang Ertel,et al. Random competition: a simple, but efficient method for parallelizing inference systems , 1990, Forschungsberichte, TU Munich.
[4] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.
[5] Ewing L. Lusk,et al. Parallelizing the Closure Computation in Automated Deduction , 1990, CADE.
[6] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[7] Stephen J. Garland,et al. A Parallel Completion Procedure for Term Rewriting Systems , 1992, CADE.
[8] Mark E. Stickel,et al. A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity , 1984, CADE.
[9] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[10] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[11] Donald E. Knuth,et al. Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .