Computing Induction Axioms
暂无分享,去创建一个
[1] Frank van Harmelen,et al. A Rational Reconstruction and Extension of Recursion Analysis , 1989, IJCAI.
[2] Christoph Walther,et al. Combining Induction Axioms by Machine , 1993, IJCAI.
[3] Martin Protzen,et al. Disproving Conjectures , 1992, CADE.
[4] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.
[5] Dieter Hutter,et al. The Karlsruhe Induction Theorem Proving System , 1986, CADE.
[6] Raymond AUBIN,et al. Mechanizing Structural Induction Part I: Formal System , 1979, Theor. Comput. Sci..
[7] Deepak Kapur,et al. Proof by Consistency , 1987, Artif. Intell..
[8] Robert S. Boyer,et al. Proving Theorems about LISP Functions , 1973, JACM.
[9] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.
[10] Uday S. Reddy,et al. Term Rewriting Induction , 1990, CADE.
[11] Rod M. Burstall,et al. Proving Properties of Programs by Structural Induction , 1969, Comput. J..
[12] Raymond Aubin,et al. Mechanizing structural induction , 1976 .
[13] Christoph Walther,et al. Argument-Bounded Algorithms as a Basis for Automated Termination Proofs , 1988, CADE.