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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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.)
Chen, J. and Kundu, S., Strong semantics for logic program — Part I, Technical Rept., Computer Sc. Dept, Louisiana State University, June 1991.
Kundu, S. and Chen, J., Strong semantics for disjunctive programs — Part II, in preparation, July 1991.
Schlipf, J. S., Formalizing a logic for logic programming, International Symp. on Artificial Intelligence and Math, Florida, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Kundu, S. (1991). The strong semantics for logic programs. In: Ras, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1991. Lecture Notes in Computer Science, vol 542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54563-8_112
Download citation
DOI: https://doi.org/10.1007/3-540-54563-8_112
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54563-7
Online ISBN: 978-3-540-38466-3
eBook Packages: Springer Book Archive