Tabulated resolution for the well-founded semantics

• Based on the search forest for positive programs as defined by Bol and Degerstedt, we define a tabulation-based framework that is sound and complete (when floundering does not occur) w.r.t. the well-founded semantics. In contrast to SLS-resolution as proposed by Przymusinski and by Ross, a positivistic computation rule is not required. Moreover, unlike SLG-resolution due to Chen and Warren, our proposal relies on tabulation for both positive and negative recursion without losing the clear separation of the search space from search strategies. In particular, the newly proposed search forest is finite for nonfloundering functor-free programs.

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Publication and Content Type

ref (subject category)

art (subject category)