How can we prove that a proof search method is not an instance of another?
Authors:
Open Access
- 2 August 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 84-87
Abstract
No abstract availableAll Related Versions
This publication has 5 references indexed in Scilit:
- What Is a Theory?Lecture Notes in Computer Science, 2002
- Resolution Theorem Proving2001
- Automatic Theorem Proving With Renamable and Semantic ResolutionJournal of the ACM, 1967
- Efficiency and Completeness of the Set of Support Strategy in Theorem ProvingJournal of the ACM, 1965
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965