Recycling Computed Answers in Rewrite Systems for Abduction: 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:2415:24, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,146 bytes +2,146‎ Created page with "Title: Recycling Computed Answers in Rewrite Systems for Abduction Abstract: This research investigates the possibility of recycling previously computed answers in non-monotonic systems, specifically focusing on rewrite procedures for abduction in logic programming under partial stable model semantics. The main result is a theorem that shows that recycling preserves the soundness and completeness of the procedure. This work contributes to the field by providing a non-tr..."
Retrieved from "https://simplesci.org/wiki/Recycling_Computed_Answers_in_Rewrite_Systems_for_Abduction"