Abstract

Recently, the well-founded semantics of a logic program P has been strengthened to the well-founded semantics-by-case (WF C ) and then again to the extended well-founded semantics (WF E ). An important concept used in both WF C and WF E 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 WF C -semantics and the WF E -semantics do not have the GCWA-property. If we first apply the WF E -semantics to P and then apply the strong semantics to a suitably simplified form of P based on its WF E -semantics, then the resulting semantics is stronger than the WF E -semantics and has the GCWA-property.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.