Abstract
The aim of the paper is to analyse non-monotonic reasoning for universal theories and logic programs within the framework of inference operations based on model operators. Several results and approaches in logic programming are surveyed and classified within this framework. The ideas presented here are aimed at a unified approach to a theory of non-monotonic reasoning for logic programs.
This is a preview of subscription content, log in via an institution to check access.
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
Baral,C., J.Lobe, J.Minker: Generalized Well-founded Semantics for Logic Programs; in: M. Stickel (ed.) lo th International Conf. on Automated Deduction, LNCS 449 (1990), 102–116.
Cavedon,L., J.W.Lloyd: A Completeness Theorem for SLDNF-Resolution; Journal of Logic Programming 1989, 7, 177–191
Dix,J.: Cumulativity in Semantics of Normal Logic Programs, NIL (Workshop on Nonmonotonic and Inductive Logic), 4.-7.12.1990, Karlsruhe(Ed. P. Schmitt)
Dix,J.: Letter Communication, 1991
Goltz,H.-J., Herre,H.: Grundlagen der logischen Programmierung, Akademie-Verlag, Berlin 1990
Herre,H.: Negation and Constructivity in Logic Programming. J. New Gener. Comput. Syst. 1 (1988), 295–305
Herre,H.: Nonmonotonic Reasoning and Logic Programs NIL '91 Karlsruhe 1990, to appear 1991
Jäger,G.: Non-monotonic reasoning by axiomatic extensions, in: J.E. Fenstad, I.T., Frolow, R. Hilpinene, Proc. 8th International Congress in Logic, Methodology and Philosophy of Sciences, North-Holland, Amsterdam 1988
Jäger,G.: Annotations on the consistency of the closed world assumption; Journal of L. P. 1990
Kunen,K.: Negation in Logic Programming; J. Of Logic Programming, 4 (1987), 289–308
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 (Manuskript: 1990)
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
Naish,L.: Negation and control in Prolog. LNCS vol. 238, Springer Verlag, 1986
Przymusinski,T.: Every Logic Program has a natural Stratification and an iterated fixed point model. TR (1988), Departm. of Mathematics, Univ. of Texas at El Paso, TX 79968
Przymusinki,T.C.: Non-monotonic Reasoning vs Logic Programming: A New Perspective; to appear in: Handbook on the Formal Foundation of A.I.
Stickel,M.: A Prolog technology theorem prover. New Gener. Computing 2 (1984), 371–383
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
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herbe, H. (1992). Semantics of nonmonotonic reasoning in logic programming. In: Pearce, D., Wansing, H. (eds) Nonclassical Logics and Information Processing. All-Berlin 1990. Lecture Notes in Computer Science, vol 619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031927
Download citation
DOI: https://doi.org/10.1007/BFb0031927
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55745-6
Online ISBN: 978-3-540-47280-3
eBook Packages: Springer Book Archive