Computing the Well-Founded Semantics: A Summary: 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 01:5401:54, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,356 bytes +1,356‎ Created page with "Title: Computing the Well-Founded Semantics: A Summary Research Question: How can the well-founded semantics of logic programs with negation be computed efficiently? Methodology: The researchers studied extensions and modifications of the alternating-fixpoint approach, a method used to compute the well-founded semantics. They focused on programs with rules that have no more than one positive occurrence of an atom in their bodies. They proposed a new implementation of t..."
Retrieved from "https://simplesci.org/wiki/Computing_the_Well-Founded_Semantics:_A_Summary"