Unnecessary inferences in associative-commutative completion procedures
暂无分享,去创建一个
[1] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[2] Paliath Narendran,et al. Complexity of Matching Problems , 1987, J. Symb. Comput..
[3] Franz Winkler. Reducing the Complexity of the Knuth-Bendix Completion-Algorithm: A "Unification" of Different Approaches , 1985, European Conference on Computer Algebra.
[4] Mark E. Stickel,et al. Complete Sets of Reductions for Some Equational Theories , 1981, JACM.
[5] Mark E. Stickel. A Complete Unification Algorithm for Associative-Commutative Functions , 1975, IJCAI.
[6] Wolfgang Küchlin,et al. Inductive Completion by Ground Proof Transformation , 1989 .
[7] 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).
[8] Bruno Buchberger,et al. A criterion for detecting unnecessary reductions in the construction of Groebner bases , 1979, EUROSAM.
[9] Robert L. Veroff. Canonicalization and Demodulation , 1981 .
[10] George A. Robinson,et al. Paramodulation and set of support , 1970 .
[11] Bruno Buchberger,et al. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm , 1983, SIGS.
[12] Deepak Kapur,et al. RRL: A Rewrite Rule Laboratory , 1986, CADE.
[13] J. Hullot. A Catalogue of Canonical Term Rewriting Systems. , 1980 .
[14] James R. Slagle,et al. Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity , 1974, JACM.
[15] Paliath Narendran,et al. Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure , 1988, J. Symb. Comput..
[16] Jörg H. Siekmann,et al. Opening the AC-unification race , 2004, Journal of Automated Reasoning.
[17] Deepak Kapur,et al. Consider Only General Superpositions in Completion Procedures , 1989, RTA.
[18] Mark E. Stickel,et al. A Unification Algorithm for Associative-Commutative Functions , 1981, JACM.
[19] Wolfgang Küchlin,et al. A Confluence Criterion Based on the Generalised Neman Lemma , 1985, European Conference on Computer Algebra.
[20] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.
[21] Tie-Cheng Wang. Case studies of Z-module reasoning: Proving benchmark theorems from ring theory , 2004, Journal of Automated Reasoning.
[22] W. W. Bledsoe,et al. Non-Resolution Theorem Proving , 1977, Artif. Intell..
[23] Hantao Zhang,et al. Automated Proof of Ring Commutativity Problems by Algebraic Methods , 1990, J. Symb. Comput..
[24] Deepak Kapur,et al. A Case Study of the Completion Procedure: Proving Ring Commutativity Problems , 1991, Computational Logic - Essays in Honor of Alan Robinson.
[25] 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 .
[26] Nachum Dershowitz,et al. Critical-pair criteria for the Knuth-Bendix completion procedure , 1986, SYMSAC '86.
[27] 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.
[28] N. Jacobson. Structure Theory for Algebraic Algebras of Bounded Degree , 1945 .
[29] Dallas Lankford,et al. High-performance permutative completion , 1989 .
[30] Ralph W. Wilkerson,et al. Complete Sets of Reductions Modulo Associativity, Commutativity and Identity , 1989, RTA.
[31] Deepak Kapur,et al. RRL: A Rewrite Rule Laboratory , 1986, CADE.
[32] Gérard P. Huet,et al. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..