Redundancy criteria for constrained completion (Q5055781): 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.1007/978-3-662-21551-7_2
+Normal rank
@@ Property / OpenAlex ID @@
+W4299522952
@@ Property / OpenAlex ID: W4299522952 / rank @@
+Normal rank
@@ 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 @@
+Equational problems and disunification
@@ Property / cites work: Equational problems and disunification / 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 @@
+Q3702509
@@ Property / cites work: Q3702509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3745825
@@ Property / cites work: Q3745825 / rank @@
+Normal rank
@@ Property / cites work @@
+Unnecessary inferences in associative-commutative completion procedures
+Normal rank
@@ Property / cites work @@
+Complete sets of reductions with constraints
@@ Property / cites work: Complete sets of reductions with constraints / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5055781