Refinements to depth-first iterative-deepening search in automatic theorem proving
From MaRDI portal
(Redirected from Publication:582116)
Recommendations
- Interaction and depth against nondeterminism in proof search
- Increasing the efficiency of automated theorem proving
- scientific article; zbMATH DE number 3938595
- Depth-first proof search without backtracking for free-variable clausal tableaux
- The search efficiency of theorem proving strategies
- scientific article; zbMATH DE number 1113998
- Automating Inductive Proofs Using Theory Exploration
- scientific article; zbMATH DE number 3986666
- Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps
- About the Completeness of Depth-First Proof-Number Search
Cites work
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- Complexity and related enhancements for automated theorem-proving programs
- Depth-first iterative-deepening: An optimal admissible tree search
- Hierarchical deduction
- scientific article; zbMATH DE number 4180829 (Why is no real title available?)
- scientific article; zbMATH DE number 3347627 (Why is no real title available?)
- Non-Horn clause logic programming without contrapositives
- Probabilistic analysis of the complexity of A*
Cited in
(2)
This page was built for publication: Refinements to depth-first iterative-deepening search in automatic theorem proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582116)