Automating Inductionless Induction Using Test Sets
暂无分享,去创建一个
[1] Tobias Nipkow,et al. A decidability result about sufficient-completeness of axiomatically specified abstract data types , 1983, Theoretical Computer Science.
[2] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[3] Joseph A. Goguen,et al. How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.
[4] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.
[5] Bruno Buchberger,et al. A criterion for detecting unnecessary reductions in the construction of Groebner bases , 1979, EUROSAM.
[6] Laurent Fribourg. A Strong Restriction of the Inductive Completion Procedure , 1989, J. Symb. Comput..
[7] John V. Guttag,et al. The specification and application to programming of abstract data types. , 1975 .
[8] Gérard P. Huet,et al. Proofs by Induction in Equational Theories with Constructors , 1980, FOCS.
[9] Wolfgang Küchlin,et al. A Confluence Criterion Based on the Generalised Neman Lemma , 1985, European Conference on Computer Algebra.
[10] Paliath Narendran,et al. Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure , 1988, J. Symb. Comput..
[11] Wolfgang Küchlin,et al. Inductive Completion by Ground Proof Transformation , 1989 .
[12] Deepak Kapur,et al. RRL: A Rewrite Rule Laboratory , 1986, CADE.
[13] Paliath Narendran,et al. Proof by Induction Using Test Sets , 1986, CADE.
[14] Tobias Nipkow,et al. A decidability result about sufficient-completeness of axiomatically specified abstract data types , 1983 .
[15] Deepak Kapur,et al. Inductive Reasoning with Incomplete Specifications (Preliminary Report) , 1986, LICS.
[16] 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).
[17] David R. Musser,et al. On proving inductive properties of abstract data types , 1980, POPL '80.
[18] Jean-Pierre Jouannaud,et al. Automatic Proofs by Induction in Theories without Constructors , 1989, Inf. Comput..
[19] Deepak Kapur,et al. A Mechanizable Induction Principle for Equational Specifications , 1988, CADE.
[20] Paliath Narendran,et al. On Ground-Confluence of Term Rewriting Systems , 1990, Inf. Comput..
[21] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.
[22] Gérard P. Huet,et al. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..
[23] David A. Plaisted,et al. Semantic Confluence Tests and Completion Methods , 1985, Inf. Control..
[24] Deepak Kapur,et al. Proof by Consistency , 1987, Artif. Intell..