Tabulated resolution for the well-founded semantics
1998 (English)In: JOURNAL OF LOGIC PROGRAMMING, ISSN 0743-1066, Vol. 34, no 2, 67-109 p.Article in journal (Other scientific) Published
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 the well-founded semantics. In contrast to SLS-resolution as propose
Place, publisher, year, edition, pages
ELSEVIER SCIENCE INC , 1998. Vol. 34, no 2, 67-109 p.
LOGIC PROGRAMS; NEGATION
IdentifiersURN: urn:nbn:se:uu:diva-28386OAI: oai:DiVA.org:uu-28386DiVA: diva2:56282
Addresses: Bol R, Univ Uppsala, CSD, S-75105 Uppsala, Sweden. Univ Uppsala, CSD, S-75105 Uppsala, Sweden. InfoSyst AB, SoftLab, S-11122 Stockholm, Sweden.2008-10-172008-10-172011-01-14