On fairness of completion-based theorem proving strategies (Q5055773): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-53904-2_109
+Normal rank
@@ Property / OpenAlex ID @@
+W1520405208
@@ Property / OpenAlex ID: W1520405208 / rank @@
+Normal rank
@@ Property / cites work @@
+Completion of first-order clauses with equality by strict superposition
+Normal rank
@@ Property / cites work @@
+Orderings for term-rewriting systems
@@ Property / cites work: Orderings for term-rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+A maximal-literal unit strategy for horn clauses
@@ Property / cites work: A maximal-literal unit strategy for horn clauses / rank @@
+Normal rank
@@ Property / cites work @@
+Q3028369
@@ Property / cites work: Q3028369 / rank @@
+Normal rank
@@ Property / cites work @@
+A complete proof of correctness of the Knuth-Bendix completion algorithm
+Normal rank
@@ Property / cites work @@
+Q5581665
@@ Property / cites work: Q5581665 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3798649
@@ Property / cites work: Q3798649 / rank @@
+Normal rank
@@ Property / cites work @@
+How to avoid the derivation of redundant clauses in reasoning systems
+Normal rank