On using ground joinable equations in equational theorem proving (Q1404987): Difference between revisions

@@ Property / cites work @@
+Rewrite-based Equational Theorem Proving with Selection and Simplification
+Normal rank
@@ Property / cites work @@
+Towards a foundation of completion procedures as semidecision procedures
+Normal rank
@@ Property / cites work @@
+Q4936127
@@ Property / cites work: Q4936127 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4524770
@@ Property / cites work: Q4524770 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3028369
@@ Property / cites work: Q3028369 / rank @@
+Normal rank
@@ Property / cites work @@
+On ground-confluence of term rewriting systems
@@ Property / cites work: On ground-confluence of term rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5581665
@@ Property / cites work: Q5581665 / rank @@
+Normal rank
@@ Property / cites work @@
+Theorem proving with ordering and equality constrained clauses
+Normal rank
@@ Property / cites work @@
+A Technique for Establishing Completeness Results in Theorem Proving with Equality
+Normal rank
@@ Property / cites work @@
+Complete Sets of Reductions for Some Equational Theories
+Normal rank
@@ Property / cites work @@
+The CADE-16 ATP system competition
@@ Property / cites work: The CADE-16 ATP system competition / rank @@
+Normal rank
@@ Property / cites work @@
+The TPTP problem library. CNF release v1. 2. 1
@@ Property / cites work: The TPTP problem library. CNF release v1. 2. 1 / rank @@
+Normal rank