Publisher
Springer Berlin Heidelberg
Reference107 articles.
1. Lect Notes Comput Sci,1996
2. P. B. Andrews, M. Bishop, I. Sunil, D. Nesmith, F. Pfenning, and H. Xi. TPS: A theorem proving system for classical type theory. Journal of Automated Reasoning, 16(3):321–353, 1996.
3. L. Augustsson, T. Coquand, and B. Nordström. A short description of another logical framework. In Proceedings of the First Workshop on Logical Frameworks, Antibes, pages 39–42, 1990.
4. L. Bachmair and H. Ganzinger. On restrictions of ordered paramodulation with simplification. In M. E. Stickel, editor, Proc. 10th Int. Conf. on Automated Deduction, Kaiserslautern, volume 449, pages 427–441. Springer-Verlag, 1990.
5. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217–247, 1994. Revised version of Research Report MPI-I-91-208, 1991.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献