Termination by absence of infinite chains of dependency pairs (Q5878910): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-61064-2_38
+Normal rank
@@ Property / OpenAlex ID @@
+W1524014168
@@ Property / OpenAlex ID: W1524014168 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4537515
@@ Property / cites work: Q4537515 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4846997
@@ Property / cites work: Q4846997 / rank @@
+Normal rank
@@ Property / cites work @@
+The integration of functions into logic programming: From theory to practice
+Normal rank
@@ Property / cites work @@
+Foundations of equational logic programming
@@ Property / cites work: Foundations of equational logic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3883561
@@ Property / cites work: Q3883561 / rank @@
+Normal rank
@@ Property / cites work @@
+Unification theory
@@ Property / cites work: Unification theory / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic termination proofs with transformation orderings
+Normal rank
@@ Property / cites work @@
+Termination of term rewriting: Interpretation and type elimination
+Normal rank
@@ Property / cites work @@
+Q4847000
@@ Property / cites work: Q4847000 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5878910