A simple correctness proof for magic transformation (Q4897705): Difference between revisions

@@ Property / cites work @@
+Proof methods of declarative properties of definite programs
+Normal rank
@@ Property / cites work @@
+The s-semantics approach: Theory and applications
@@ Property / cites work: The s-semantics approach: Theory and applications / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of magic
@@ Property / cites work: On the power of magic / rank @@
+Normal rank
@@ Property / cites work @@
+Inductive assertion method for logic pograms
@@ Property / cites work: Inductive assertion method for logic pograms / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about prolog programs: From modes through types to assertions
+Normal rank
@@ Property / cites work @@
+Abstract interpretation: a kind of magic
@@ Property / cites work: Abstract interpretation: a kind of magic / rank @@
+Normal rank
@@ Property / cites work @@
+Q4707746
@@ Property / cites work: Q4707746 / rank @@
+Normal rank
@@ Property / cites work @@
+Proving correctness and completeness of normal programs – a declarative approach
+Normal rank
@@ Property / cites work @@
+Magic templates: a spellbinding approach to logic programs
+Normal rank
@@ Property / OpenAlex ID @@
+W2134148399
@@ Property / OpenAlex ID: W2134148399 / rank @@
+Normal rank