Towards efficient subsumption
We propose several methods for writing efficient subsumption procedures for non-unit clauses, tested in practice as parts incorporated into the Gandalf family of theorem provers. Versions of Gandalf exist for classical logic, first order intuitionistic logic and type theory.
KeywordsClassical Logic Type Theory Intuitionistic Logic Unit Clause Proof Search
Unable to display preview. Download preview PDF.
- 1.C. Fermüller, A. Leitsch, T. Tammet, N. Zamov. Resolution methods for decision problems. Lecture Notes in Artificial Intelligence vol. 679, Springer Verlag, 1993.Google Scholar
- 2.P. Graf. Term Indexing. Lecture Notes in Computer Science. 1053, Springer Verlag, 1996.Google Scholar
- 4.L. Magnusson, B. Nordström. The ALF proof editor and its proof engine. In Types for Proofs and Programs, pages 213–237, Lecture Notes in Computer Science vol. 806, Springer Verlag, 1994.Google Scholar
- 6.W. McCune. OTTER 3.0 Reference Manual and Users Guide. Tech. Report ANL-94/6, Argonne National Laboratory, Argonne, IL, January 1994.Google Scholar
- 9.T. Tammet. A Resolution Theorem Prover for Intuitionistic Logic. In CADE-13, pages 2–16, Lecture Notes in Computer Science vol. 1104, Springer Verlag, 1996.Google Scholar
- 10.T. Tammet, J. Smith. Optimised Encodings of Fragments of Type Theory in First Order Logic. In Types for Proofs and Programs, pages 265–287, Lecture Notes in Computer Science vol. 1158, Springer Verlag,1996.Google Scholar