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 the well-founded semantics. In contrast to SLS-resolution as propose

Nyckelord

LOGIC PROGRAMS; NEGATION

Publikations- och innehållstyp

vet (ämneskategori)

art (ämneskategori)