Meta-rule synthesis from crossed rewrite systems (Q5881274): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-54317-1_87
+Normal rank
@@ Property / OpenAlex ID @@
+W1482133761
@@ Property / OpenAlex ID: W1482133761 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q3719824
@@ Property / cites work: Q3719824 / rank @@
+Normal rank
@@ Property / cites work @@
+Equational completion in order-sorted algebras
@@ Property / cites work: Equational completion in order-sorted algebras / rank @@
+Normal rank
@@ Property / cites work @@
+On Proving Uniform Termination and Restricted Termination of Rewriting Systems
+Normal rank
@@ Property / cites work @@
+Chain properties of rule closures
@@ Property / cites work: Chain properties of rule closures / rank @@
+Normal rank
@@ Property / cites work @@
+A complete proof of correctness of the Knuth-Bendix completion algorithm
+Normal rank
@@ Property / cites work @@
+Completion of a Set of Rules Modulo a Set of Equations
+Normal rank
@@ Property / cites work @@
+Q5581665
@@ Property / cites work: Q5581665 / rank @@
+Normal rank
@@ Property / cites work @@
+Schematization of infinite sets of rewrite rules generated by divergent completion processes
+Normal rank
@@ Property / cites work @@
+Complete Sets of Reductions for Some Equational Theories
+Normal rank
@@ Property / cites work @@
+Q3819991
@@ Property / cites work: Q3819991 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5881274