Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Andrews, P.B.: Resolution in type theory. The Journal of Symbolic Logic 36, 414–432 (1971)
2. Bachmair, L., Ganzinger, H.: Resolution Theorem Proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning. Elsevier, Amsterdam (2001)
3. Burel, G.: Embedding Deduction Modulo into a Prover, manuscript available on the web page of the author (2010)
4. Burel, G., Dowek, G.: How can we prove that a proof search method is not an instance of another? In: Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice. ACM International Conference Proceeding Series (2009)
5. Lecture Notes in Computer Science;G. Dowek,2002
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献