Speedup of Logic Programs by Binarization and Partial Deduction: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 15:0315:03, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,728 bytes +1,728‎ Created page with "Title: Speedup of Logic Programs by Binarization and Partial Deduction Research Question: Can binarization and partial deduction improve the computational behavior of logic programs? Methodology: The authors propose a transformation of logic programs to binary logic programs. This transformation involves two steps: binarization and partial deduction. Binarization transforms the original program into a binary program, which contains only clauses with at most one atom in..."
Retrieved from "https://simplesci.org/wiki/Speedup_of_Logic_Programs_by_Binarization_and_Partial_Deduction"