Advertisement

The strong semantics for logic programs

  • Jianhua Chen
  • Sukhamay Kundu
Communications Logic For Artificial Intelligence
Part of the Lecture Notes in Computer Science book series (LNCS, volume 542)

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.

Keywords

Derived rule logic program declarative semantics GCWA-property 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Baral, C., Lobo, J., and Minker, J. Generalized disjunctive well-founded semantics for logic programs: declarative semantics, Proc. of 5th International Symposium on Methodologies for Intelligent Systems, Knoxville (1990), pp. 465–473.Google Scholar
  2. [2]
    Baral, C., Lobo, J., and Minker, J., Generalized disjunctive well-founded semantics for logic programs: procedural semantics, Proc. of 5th International Symposium on Methodologies for Intelligent Systems, Knoxville (1990), pp. 456–464.Google Scholar
  3. [3]
    Hu, Y. and Yuan, L. Y., Extended well-founded model semantics for general logic program, The 8th International Conference on Logic Programming (ICLP), Paris, 1991.Google Scholar
  4. [4]
    Kundu, S. and Chen, J., A new and simple method for explicit computation of circumscription, Proc. of 5th International Symposium on Methodologies for Intelligent Systems, Knoxville (1990), pp. 522–529. (Also, see Proc. of GWAI-90, German workshop on Artificial Intelligence, Geske, 1990 for details of proofs of the theorems.)Google Scholar
  5. [5]
    Chen, J. and Kundu, S., Strong semantics for logic program — Part I, Technical Rept., Computer Sc. Dept, Louisiana State University, June 1991.Google Scholar
  6. [6]
    Kundu, S. and Chen, J., Strong semantics for disjunctive programs — Part II, in preparation, July 1991.Google Scholar
  7. [7]
    Schlipf, J. S., Formalizing a logic for logic programming, International Symp. on Artificial Intelligence and Math, Florida, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Jianhua Chen
    • 1
  • Sukhamay Kundu
    • 1
  1. 1.Computer Science DepartmentLouisiana State UniversityBaton RougeUSA

Personalised recommendations