Well-founded Semantics Of Normal Programs Research Articles

Fuzzy linguistic logic programming (FLLP) is a framework for representation and reasoning with linguistically expressed human knowledge. In this paper, we extend FLLP by allowing negative literals to appear in rule bodies, resulting in normal logic programs. We study the stable model semantics and well-founded semantics of such programs and their relation. The two kinds of semantics are adapted from those of classical ones based on the Gelfond–Lifschitz transformation and van Gelder’s alternating fixpoint approach, respectively. To our knowledge, until now, there has been no work on the well-founded semantics of normal programs in any fuzzy logic programming (FLP) framework based on Vojtáš’s FLP. Moreover, the relation between the two kinds of semantics is usually studied using a bilattice setting of the truth domain. However, our truth domains do not possess a complete knowledge-ordering lattice and, thus, do not have a bilattice structure. The two kinds of semantics possess properties similar to those of the classical case. Every stable model contains the well-founded (partial) model, and the well-founded total model coincides with the unique stable model, but not vice versa. Since the well-founded semantics is closely related to the stable model semantics, it can help compute stable models more efficiently.