Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. O. L. Astrachan and M. E. Stickel. Caching and lemmaizing in model elimination theorem provers. In D. Kapur, editor, 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Computer Science, pages 224–238, 1992. Springer-Verlag.
2. P. Baumgartner and U. Furbach. Model elimination without contrapositives and its application to PTTP. Research report 12-93, Institute for Computer Science, University of Koblenz, 1993.
3. B. Beckert and J. Posegga. leanT A P: Lean, tableau-based deduction. Journal of Automated Reasoning, 15:339–358, 1995.
4. M. J. C. Gordon and T. F. Melham. Introduction to HOL: a theorem proving environment for higher order logic. Cambridge University Press, 1993.
5. R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27:97–109, 1985.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献