The strong semantics for logic programs

Document Type

Conference Proceeding

Publication Date

1-1-1991

Abstract

Recently, the well-founded semantics of a logic program P has been strengthened to the well-founded semantics-by-case (WFC) and then again to the extended well-founded semantics (WFE). An important concept used in both WFC and WFE is that of derived rules. We extend the notion of derived rules by adding a new type of derivation and define the strong semantics of P, which has the following important property, known as the GCWA-property: if an atom p = false in all minimal models of P, then p = false in the strong semantics of P. In general, the WFC-semantics and the WFE-semantics do not have the GCWA-property. If we first apply the WFE-semantics to P and then apply the strong semantics to a suitably simplified form of P based on its WFE-semantics, then the resulting semantics is stronger than the WFE-semantics and has the GCWA-property.

Publication Source (Journal or Book title)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

First Page

490

Last Page

499

This document is currently not available here.

Share

COinS