Conditional term rewriting and first-order theorem proving (Q5881190): Difference between revisions

@@ Property / cites work @@
+Non-resolution theorem proving
@@ Property / cites work: Non-resolution theorem proving / rank @@
+Normal rank
@@ Property / cites work @@
+Proving Theorems with the Modification Method
@@ Property / cites work: Proving Theorems with the Modification Method / 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 @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Proving refutational completeness of theorem-proving strategies
+Normal rank
@@ Property / cites work @@
+Q5581665
@@ Property / cites work: Q5581665 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4264737
@@ Property / cites work: Q4264737 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4264721
@@ Property / cites work: Q4264721 / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified problem reduction format
@@ Property / cites work: A simplified problem reduction format / rank @@
+Normal rank
@@ Property / cites work @@
+Non-Horn clause logic programming without contrapositives
+Normal rank
@@ Property / cites work @@
+Q4264710
@@ Property / cites work: Q4264710 / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchical deduction
@@ Property / cites work: Hierarchical deduction / rank @@
+Normal rank
@@ Property / cites work @@
+On restrictions of ordered paramodulation with simplification
+Normal rank