Computing ground reducibility and inductively complete positions (Q5055712): 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/3-540-51081-8_100
+Normal rank
@@ Property / OpenAlex ID @@
+W2098162645
@@ Property / OpenAlex ID: W2098162645 / rank @@
+Normal rank
@@ Property / cites work @@
+Critical pair criteria for completion
@@ Property / cites work: Critical pair criteria for completion / rank @@
+Normal rank
@@ Property / cites work @@
+Q3894958
@@ Property / cites work: Q3894958 / rank @@
+Normal rank
@@ Property / cites work @@
+A strong restriction of the inductive completion procedure
+Normal rank
@@ Property / cites work @@
+Q3743300
@@ Property / cites work: Q3743300 / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs by induction in equational theories with constructors
+Normal rank
@@ Property / cites work @@
+Automatic proofs by induction in theories without constructors
+Normal rank
@@ Property / cites work @@
+Proof by consistency
@@ Property / cites work: Proof by consistency / rank @@
+Normal rank
@@ Property / cites work @@
+Q3783519
@@ Property / cites work: Q3783519 / rank @@
+Normal rank
@@ Property / cites work @@
+On sufficient-completeness and related properties of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Q3690200
@@ Property / cites work: Q3690200 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993260
@@ Property / cites work: Q3993260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3956381
@@ Property / cites work: Q3956381 / rank @@
+Normal rank
@@ Property / cites work @@
+Semantic confluence tests and completion methods
@@ Property / cites work: Semantic confluence tests and completion methods / rank @@
+Normal rank
@@ Property / cites work @@
+Q3805961
@@ Property / cites work: Q3805961 / rank @@
+Normal rank