Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computing and Information

ICCI 1991: Advances in Computing and Information — ICCI '91 pp 709–720Cite as

On semantics, syntactics and fixpoints of general programs

  • Expert Systems, Artificial Intelligence
  • Conference paper
  • First Online:

  • 107 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 497))

Abstract

In this paper, we extend the unified view of logic programs, characterized by van Emden and Kowalski, in terms of semantics, syntactics, and fixpoints into the context of general programs. We first propose a general model semantics which is a natural extension of the Herbrand model semantics. We have shown that any program has a unique least model. Then we show that the least model of a program is precisely the set of all minimally derived disjunctive facts from the program and reveal the relationship between semantics and syntactics of general programs. Finally we show that the least model of a program can also be characterized by the least fixpoint of the natural operator associated with general programs. Our unified view of general programs enhances the theoretical foundation of logic programming and deductive databases.

(Extended Abstract)

This work has been partially supported by the NSERC of Canada.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R., Blair, H.A., and Walker, A., Towards a Theory of Declarative Knowledge, in Foundations of Deductive Databases and Logic Programming, Minker, J. (editor), Morgan-Kaufman Pub., 1988, pp. 89–148.

    Google Scholar 

  2. Lloyed, J.W., Foundations of Logic Programming, 2nd Edition, Springer-Verlag, 1989.

    Google Scholar 

  3. Lobo, J., Minker, J., and Rajasekar, A., Extending the Semantics of Logic Programs to Disjunctive Logic Programs, Proc. the 6th International Conference on Logic Programming, 1988, pp. 255–267.

    Google Scholar 

  4. Minker, J., On Indefinite Databases and the Closed world Assumption, in Lecture Notes in Computer Science 138, Springer-Verlag, 1982 pp. 292–308.

    Google Scholar 

  5. Shepherdson, J.C., Negation in Logic Programming, in Foundations of Deductive Databases and Logic Programming, Minker, J. (editor), Morgan-Kaufman Pub., 1988, pp. 19–88.

    Google Scholar 

  6. van Emden, M.H. and Kowalski, R.A., The semantics of Predicate Logic as a Programming Language, JACM Vol. 23, 4, Oct. 1976, pp. 733–742.

    Article  Google Scholar 

  7. Van Gelder, A., Negation as Failure Using Tight Derivations for General Logic Programs, in Foundations of Deductive Databases and Logic Programming, Minker, J. (editor), Morgan-Kaufman Pub., 1988, pp 149–176.

    Google Scholar 

  8. Yahya, A. and Henschen, L., Deduction in Non-Horn Databases, J. of Automated Reasoning, 1, 1985, 141–160.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Alberta, T6G 2H1, Edmonton, Canada

    Li Yan Yuan

Authors
  1. Li Yan Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Frantisek Fiala Waldemar W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yuan, L.Y. (1991). On semantics, syntactics and fixpoints of general programs. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_220

Download citation

  • DOI: https://doi.org/10.1007/3-540-54029-6_220

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54029-8

  • Online ISBN: 978-3-540-47359-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation