On the Expressibility of Stable Logic: 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:0915:09, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,292 bytes +2,292‎ Created page with "Title: On the Expressibility of Stable Logic Research Question: Can Stable Logic Programming (SLP) solve all search problems in the class NP? Methodology: The researchers used a uniform approach as defined in (MT99) to prove that SLP can solve all search problems in the class NP. They specifically showed that there is a single DATALOG⁺-program PTrg such that, given any Turing machine M, any polynomial p with non-negative integer coefficients, and any input σ of size..."
Retrieved from "https://simplesci.org/wiki/On_the_Expressibility_of_Stable_Logic"