On the complexity of regular resolution and the Davis-Putnam procedure (Q1249435): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(77)90054-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2070017679
@@ Property / OpenAlex ID: W2070017679 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4152212
@@ Property / cites work: Q4152212 / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Forest embeddings in regular graphs of large girth
+Normal rank
@@ Property / cites work @@
+A Way to Simplify Truth Functions
@@ Property / cites work: A Way to Simplify Truth Functions / rank @@
+Normal rank
@@ Property / cites work @@
+A Machine-Oriented Logic Based on the Resolution Principle
+Normal rank