Reference59 articles.
1. P. Andrews. Theorem Proving via General Matings. Journal of the Association for Computing Machinery, 28 (2): 193–214, 1981.
2. O. W. Astrachan and M. E. Stickel. Caching and Lemmaizing in Model Elimination Theorem Provers. Proceedings of the 11th Conference on Automated Deduction (CADE-11), LNAI 607, Saratoga Springs, pages 224–238, Springer, 1992.
3. M. Baaz and A. Leitsch. Complexity of Resolution Proofs and Function Introduction. Annals of Pure and Applied Logic, 57: 181–215, 1992.
4. M. Baaz and C. G. Fermüller. Non-elementary Speedups between Different Versions of Tableaux. In Proceedings of Tableaux95, 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 217–230, 1995.
5. B. Beckert, R. Hähnle, and P. Schmitt. The even more liberalized 8-rule in free variable semantic tableaux. In Computational Logic and Proof Theory,Proceedings of the 3rd Kurt Gödel Colloquium, Springer, pages 108–119, 1993.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献