Skip to main content
SpringerLink
Log in

The strong semantics for logic programs

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

Recently, the well-founded semantics of a logic programP 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 thelogical consequence property, namely, if an atomAj is true in the theory Th(P), thenAj is true in the semantics as well. However, neither WFC nor WFE has the GCWA property, i.e., if an atomAj is false in all minimal models ofP,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 ofderived 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baral, C., Lobo, J., and Minker, J. (1990). Generalized disjunctive well-founded semantics for logic programs: declarative semantics,Proc. of 5th International Symposium on Methodologies for Intelligent Systems, Knoxville (pp. 465–473).

  • Baral, C., Lobo, J., and Minker, J. (1990). Generalized disjunctive well-founded semantics for logic programs: procedural semantics,Proc. of 5th International Symposium on Methodologies for Intelligent Systems, Knoxville (pp. 456–464).

  • Chen, J. (1992). A Refined Semantics for Disjunctive Logic Programs, To appear in the journalMethods of Logic in Computer Science, a short version of it appears in the Proceedings of the 1992 Europe Conference on AI.

  • Chen, J. and Kundu, S. (1991). The Strong Semantics for Logic Programs,Proc. of 6th International Symposium on Methodologies for Intelligent Systems, Charlotte (pp. 490–499).

  • Hu, Y. and Yuan, L.Y. (1991). Extended well-founded model semantics for general logic program,The 8th International Conference on Logic Programming (ICLP), Paris.

  • Kundu, S. and Chen, J. (1990). A new and simple method for explicit computation of circumscription,Proc. of 5th International Symposium on Methodologies for Intelligent Systems, Knoxville (pp. 522–529). (Also see Proc. of GWAI-90, German workshop on Artificial Intelligence, Geske, 1990 for details of proofs of the theorems.) Schlipf, J.S. (1990). Formalizing a logic for logic programming,International Symp. on Artificial Intelligence and Math, Florida.

  • Van Gelder, A., Ross, K., and Schlipf, J.S. (1991). The well-founded semantics for general logic programs,Journal of the ACM, 38(3) (pp. 620–650).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Louisiana State University, 70803, Baton Rouge, LA, USA

    Jianhua Chen & Sukhamay Kundu

Authors
  1. Jianhua Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sukhamay Kundu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, J., Kundu, S. The strong semantics for logic programs. J Intell Inf Syst 5, 51–68 (1995). https://doi.org/10.1007/BF01928539

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01928539

Keywords

Search

Navigation