Redundancy criteria for constrained completion (Q673620): Difference between revisions

@@ Property / cites work @@
+Rewrite-based Equational Theorem Proving with Selection and Simplification
+Normal rank
@@ Property / cites work @@
+Critical pair criteria for completion
@@ Property / cites work: Critical pair criteria for completion / rank @@
+Normal rank
@@ Property / cites work @@
+Q4000281
@@ Property / cites work: Q4000281 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4264723
@@ Property / cites work: Q4264723 / rank @@
+Normal rank
@@ Property / cites work @@
+SOLVING SYMBOLIC ORDERING CONSTRAINTS
@@ Property / cites work: SOLVING SYMBOLIC ORDERING CONSTRAINTS / rank @@
+Normal rank
@@ Property / cites work @@
+Proving refutational completeness of theorem-proving strategies
+Normal rank
@@ Property / cites work @@
+Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
+Normal rank
@@ Property / cites work @@
+Q4036585
@@ Property / cites work: Q4036585 / rank @@
+Normal rank
@@ Property / cites work @@
+Only prime superpositions need be considered in the Knuth-Bendix completion procedure
+Normal rank
@@ Property / cites work @@
+Q3702510
@@ Property / cites work: Q3702510 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4264721
@@ Property / cites work: Q4264721 / rank @@
+Normal rank
@@ Property / cites work @@
+Using forcing to prove completeness of resolution and paramodulation
+Normal rank
@@ Property / cites work @@
+Q3490936
@@ Property / cites work: Q3490936 / rank @@
+Normal rank
@@ Property / cites work @@
+A proof theory for general unification
@@ Property / cites work: A proof theory for general unification / rank @@
+Normal rank
@@ Property / cites work @@
+Q3702509
@@ Property / cites work: Q3702509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3745825
@@ Property / cites work: Q3745825 / rank @@
+Normal rank
@@ Property / cites work @@
+Consider only general superpositions in completion procedures
+Normal rank
@@ Property / cites work @@
+Unnecessary inferences in associative-commutative completion procedures
+Normal rank