A General Framework to Build Contextual Cover Set Induction Provers-Reference-Cited by-同舟云学术

A General Framework to Build Contextual Cover Set Induction Provers

Author:

Stratulat Sorin

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference54 articles.

1. Mechanizing structural induction;Aubin;Theor. Comput. Sci.,1979

2. Theorem proving in hierarchical clausal specifications Advances in Algorithms, Languages, and Complexity;Avenhaus,1997

3. Proof by consistency in equational theories;Bachmair,1988

4. Buchberger’s algorithm: a constraint-based completion procedure;Bachmair,1994

5. Gröbner Bases: a Computational Approach to Commutative Algebras;Becker,1993

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. SPIKE, an automatic theorem prover — revisited;2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2020-09

3. Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07