Automated Proof of Ring Commutativity Problems by Algebraic Methods
暂无分享,去创建一个
[1] 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.
[2] N. Jacobson. Structure Theory for Algebraic Algebras of Bounded Degree , 1945 .
[3] Bruno Buchberger,et al. History and Basic Features of the Critical-Pair/Completion Procedure , 1987, J. Symb. Comput..
[4] W. W. Bledsoe,et al. Non-Resolution Theorem Proving , 1977, Artif. Intell..
[5] Deepak Kapur,et al. A Case Study of the Completion Procedure: Proving Ring Commutativity Problems , 1991, Computational Logic - Essays in Honor of Alan Robinson.
[6] Robert L. Veroff. Canonicalization and Demodulation , 1981 .
[7] Anthony Preston,et al. Book review: Automated Reasoning: 33 Basic Research Problems by Larry Wos (Prentice Hall 1988) , 1988, SGAR.