Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419): Difference between revisions

@@ Property / cites work @@
+Q3983042
@@ Property / cites work: Q3983042 / rank @@
+Normal rank
@@ Property / cites work @@
+A transformational approach to negation in logic programming
+Normal rank
@@ Property / cites work @@
+Supporting Transformations for the Partial Evaluation of Logic Programs
+Normal rank
@@ Property / cites work @@
+A general criterion for avoiding infinite unfolding during partial deduction
+Normal rank
@@ Property / cites work @@
+Q3983041
@@ Property / cites work: Q3983041 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789064
@@ Property / cites work: Q3789064 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial evaluation of metaprograms in a ``multiple worlds'' logic language
+Normal rank
@@ Property / cites work @@
+Q3339245
@@ Property / cites work: Q3339245 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial evaluation in logic programming
@@ Property / cites work: Partial evaluation in logic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624681
@@ Property / cites work: Q5624681 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624680
@@ Property / cites work: Q5624680 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3742690
@@ Property / cites work: Q3742690 / rank @@
+Normal rank