Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications (Q968529): Difference between revisions

@@ Property / cites work @@
+Improving Context-Sensitive Dependency Pairs
@@ Property / cites work: Improving Context-Sensitive Dependency Pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Ground reducibility is EXPTIME-complete
@@ Property / cites work: Ground reducibility is EXPTIME-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4520814
@@ Property / cites work: Q4520814 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4346205
@@ Property / cites work: Q4346205 / rank @@
+Normal rank
@@ Property / cites work @@
+The algebraic specification of abstract data types
+Normal rank
@@ Property / cites work @@
+On the Completeness of Context-Sensitive Order-Sorted Specifications
+Normal rank
@@ Property / cites work @@
+On sufficient-completeness and related properties of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Q4259966
@@ Property / cites work: Q4259966 / rank @@
+Normal rank
@@ Property / cites work @@
+Context-sensitive rewriting strategies
@@ Property / cites work: Context-sensitive rewriting strategies / rank @@
+Normal rank
@@ Property / cites work @@
+Q4790352
@@ Property / cites work: Q4790352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2783416
@@ Property / cites work: Q2783416 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4799892
@@ Property / cites work: Q4799892 / rank @@
+Normal rank