Subject
Computational Mathematics,Algebra and Number Theory
Reference66 articles.
1. Theorem proving via general matings;Andrews;J. ACM,1981
2. A rewriting approach to satisfiability procedures;Armando;Inform. Comput.,2003
3. The use of lemmas in the model elimination procedure;Astrachan;J. Automat. Reason.,1997
4. Caching and lemmaizing in model elimination theorem provers;Astrachan,1992
5. A non-elementary speed-up in proof length by structural clause form transformation;Baaz,1994
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献