PROOF OF UNSATISFIABILITY OF ATOM SETS BASED ON COMPUTATION BY EQUIVALENT TRANSFORMATION RULES
暂无分享,去创建一个
[1] Hiroshi Motoda,et al. Proving Definite Clauses without Explicit Use of Inductions , 1988, LP.
[2] Kiyoshi Akama,et al. Program Generation in the Equivalent Transformation Computation Model Using the Squeeze Method , 2006, Ershov Memorial Conference.
[3] Kiyoshi Akama,et al. Generating Speq Rules based on Automatic Proof of Logical Equivalence , 2008 .
[4] Kiyoshi Akama,et al. Equivalent Transformation Rules as Components of Programs , 2006, First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06).
[5] Mandayam K. Srivas,et al. Automatic Inductive Theorem Proving Using Prolog , 1987, Theor. Comput. Sci..
[6] Akama Kiyoshi,et al. A Framework for Synthesizing low-level Imperative Programs From Deterministic Abstract Programs -- * , 2007 .
[7] Gérard P. Huet,et al. Proofs by Induction in Equational Theories with Constructors , 1980, FOCS.
[8] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.
[9] Fujii Mamoru,et al. On a translation from algebraic specifications of abstract sequential machines into programs. | Article Information | J-GLOBAL , 1990 .
[10] Robert S. Boyer,et al. Proving Theorems about LISP Functions , 1973, JACM.
[11] Minoru Harada,et al. Executable C++ program generation from the structured object-oriented design diagrams , 1999, Proceedings Sixth Asia Pacific Software Engineering Conference (ASPEC'99) (Cat. No.PR00509).
[12] Kiyoshi Akama,et al. A Theoretical Foundation for Generation of Equivalent Transformation Rules (Program Transformation, Symbolic Computation and Algebraic Manipulation) , 2000 .