Author:
Degtyarev Anatoli,Voronkov Andrei
Publisher
Springer Berlin Heidelberg
Reference47 articles.
1. P.B. Andrews. Theorem proving via general matings. Journal of the Association for Computing Machinery, 28(2):193–214, 1981.
2. M. Baaz. Note on the existence of most general semi-unifiers. In Arithmetic, Proof Theory and Computation Complexity, volume 23 of Oxford Logic Guides, pages 20–29. Oxford University Press, 1993.
3. Peter Baumgartner. An ordered theory resolution calculus. In A. Voronkov, editor, Logic Programming and Automated Reasoning (LPAR'92), volume 624 of Lecture Notes in Computer Science, pages 119–130, 1992.
4. volume 861 of Lecture Notes in Artificial Intelligence;G. Becher,1994
5. B. Beckert. A completion-based method for mixed universal and rigid E-unification. In A. Bundy, editor, Automated Deduction — CADE-12. 12th International Conference on Automated Deduction., volume 814 of Lecture Notes in Artificial Intelligence, pages 678–692, Nancy, France, June/July 1994.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献