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.
Preview
Unable to display preview. Download preview PDF.
References
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.
Lloyed, J.W., Foundations of Logic Programming, 2nd Edition, Springer-Verlag, 1989.
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.
Minker, J., On Indefinite Databases and the Closed world Assumption, in Lecture Notes in Computer Science 138, Springer-Verlag, 1982 pp. 292–308.
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.
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.
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.
Yahya, A. and Henschen, L., Deduction in Non-Horn Databases, J. of Automated Reasoning, 1, 1985, 141–160.
Author information
Authors and Affiliations
Editor information
Rights 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