Fixed-Parameter Complexity of Logic Programs: 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 02:4002:40, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,657 bytes +20‎ No edit summary undo
  • curprev 02:3902:39, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,637 bytes +1,637‎ Created page with "Title: Fixed-Parameter Complexity of Logic Programs Research Question: Can we find algorithms with running times that do not depend on the size of the parameter k, for deciding the existence of models, supported models, and stable models of logic programs? Methodology: The researchers used the framework of fixed-parameter complexity, which is a method used to study the efficiency of algorithms when a problem's input size depends on an additional parameter. They conside..."
Retrieved from "https://simplesci.org/wiki/Fixed-Parameter_Complexity_of_Logic_Programs"