Refinements to depth-first iterative-deepening search in automatic theorem proving
From MaRDI portal
Publication:582116
DOI10.1016/0004-3702(89)90011-8zbMath0689.68087OpenAlexW2003493467MaRDI QIDQ582116
Xumin Nie, David Alan Plaisted
Publication date: 1989
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(89)90011-8
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Depth-first iterative-deepening: An optimal admissible tree search
- Hierarchical deduction
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- Non-Horn clause logic programming without contrapositives
- Probabilistic analysis of the complexity of A*
- Complexity and related enhancements for automated theorem-proving programs