The strong semantics for logic programs

Document Type

Article

Publication Date

7-1-1995

Abstract

Recently, the well-founded semantics of a logic program P has been strengthened to the well-founded semantics-by-case (WFC) and this in turn has been strengthened to the extended well-founded semantics (WFE). Both WFC(P) and WFE(P) have the logical consequence property, namely, if an atom Aj is true in the theory Th(P), then Aj is true in the semantics as well. However, neither WFC nor WFE has the GCWA property, i.e., if an atom Aj is false in all minimal models of P, Aj may not be false in WFC(P) (resp. WFE(P)). We extend the ideas in WFC and WFE to define a strong well-founded semantics WFS which has the GCWA property. The strong semantics WFS(P) is defined by combining GCWA with the notion of derived rules. Here we use a new Type-III derived rules in addition to those used in WFC and WFE. The relationship between WFS and WFC is also clarified. © 1995 Kluwer Academic Publishers.

Publication Source (Journal or Book title)

Journal of Intelligent Information Systems

First Page

51

Last Page

68

This document is currently not available here.

Share

COinS