Abstract
The present paper is concerned with a unifying approach to non-monotonic reasoning in clause logic programming. An outline of a general theory of non-monotonic reasoning is given that is aimed at a foundation of this area. Typical results are presented in the frame of this theory and problems related to logic programming are discussed.
Preview
Unable to display preview. Download preview PDF.
References
Apt,K.R., H. Blair, A. Walker: Towards a Theory of Declarative Knowledge; in: Foundations of Deductive Databases and Logic Programming (Minker,J. ed.), Morgan Kaufmann, Los Altos, 1987
Bossu,G.,P.Siegel: Saturation, Nonmonotonic Reasoning and the Closed World Assumption; Artificial Intelligence vol. 25, (1985), 13–65
Cavedon,L., J.W. Lloyd: A Completeness Theorem for SLDNF-Resolution; Journal of Logic Programming 1989, 7, 177–191
Herre,H.: Konstruktive Resolutionsmethoden. Preprint P-Math 21/86, Institut für Mathematik, AdW der DDR, Berlin 1986
Herre,H.: Negation and Constructivity in Logic Programming. J. New Gener. Comput. Syst. 1 (1988), 295–305
Jäger,G. Annotations on the consistency of the closedworld assumption; Journal of L. P. 1990
Letz,R. Classical Negation in Logic Programming: TU München; Report FKI-123-89
Lloyd,J.W. Foundations of Logic Programming, Springer 1987
Makinson,D.: General Theory of Cumulative Inference, in: Reinfrank,M. (Ed.) Non-monotonic Reasoning Berlin Springer-Verlag, 1989, 1–18
Makinson,D.: General Patterns in Nonmonotonic Reasoning; in: Handbook of Logic in Artificial Intelligence and Logic Programming (draft 1990)
McCarthy,J.: Circumscription, A.I., vol. 13 ((1980), 27–39
Minker,J.: On indefinite databases and the closed world assumption. In: 6th Conference on Automated Deduction; Proceedings 1982; D.W. Loveland; Lecture Notes in Computer Science 138, Springer-Verlag, 1982
Przymusinski,T.: Every Logic Program has a natural Stratification and an iterated fixed point model. TR (1988), Departm. of Math. Univ. of Texas at El Paso, TX 79968
Reiter,R.: A Logic for Default Reasoning; AI 13 (1980), 81–132
Shoenfield,J.: Mathematical Logic, Addision Wesely, 1967
Tarski,A. Logic, Semantics, Metamathematics. Papers from 1923–1938. Clarendon Press, Oxford, 1956
Thiele,H.: Monotones und nichtmonotones Schließen; in: Grabowski,J., Jantke,H.-J., H. Thiele: Grundlagen der Künstlichen Intelligenz, 80–160, Akademie-Verlag, Berlin 1989
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herre, H. (1991). Nonmonotonic reasoning and logic programs. In: Dix, J., Jantke, K.P., Schmitt, P.H. (eds) Nonmonotonic and Inductive Logic. NIL 1990. Lecture Notes in Computer Science, vol 543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023316
Download citation
DOI: https://doi.org/10.1007/BFb0023316
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54564-4
Online ISBN: 978-3-540-38469-4
eBook Packages: Springer Book Archive