Refinements to depth-first iterative-deepening search in automatic theorem proving (Q582116): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0004-3702(89)90011-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2003493467
@@ Property / OpenAlex ID: W2003493467 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3204066
@@ Property / cites work: Q3204066 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of the complexity of A*
@@ Property / cites work: Probabilistic analysis of the complexity of A* / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-first iterative-deepening: An optimal admissible tree search
+Normal rank
@@ Property / cites work @@
+Q5623241
@@ Property / cites work: Q5623241 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and related enhancements for automated theorem-proving programs
+Normal rank
@@ Property / cites work @@
+Non-Horn clause logic programming without contrapositives
+Normal rank
@@ Property / cites work @@
+A Prolog technology theorem prover: Implementation by an extended Prolog compiler
+Normal rank
@@ Property / cites work @@
+Hierarchical deduction
@@ Property / cites work: Hierarchical deduction / rank @@
+Normal rank