The search efficiency of theorem proving strategies
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Caching and lemmaizing in model elimination theorem proversPublished by Springer Nature ,1992
- Relative Complexities of First Order CalculiPublished by Springer Nature ,1992
- Proving refutational completeness of theorem-proving strategiesJournal of the ACM, 1991
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- Automated Theorem ProvingPublished by Springer Nature ,1987
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- The intractability of resolutionTheoretical Computer Science, 1985
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979
- A Simplified Format for the Model Elimination Theorem-Proving ProcedureJournal of the ACM, 1969
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960