Abstract
Suppose we are given some collection of confirmed data items (information). We can assume that the information is represented as a set P of propositions of predicate logic. We look at P and try to use some sort of inference mechanism to extract more information out of P.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. M. Gabbay — Semantical. Investigations in Heyting’s Intuitionistic Logic. D. Reidel pub. comp. 1981.
D. M. Gabbay — Intuitionistic Basis for non monotonic Logic, Proceedings of 6th conference of automated deduction, D. W. Loveland, editor, Leciure notes in computer science 138, Springer-Verlag, 1982, pp. 260–273.
J. McCarthy — Circumscription, a form of non monotonic reasoning, in Artificial Intelligence 13, 1980, pp. 27–39.
B. Moore — Semantical considerations on non monotonic logics, Proc. 8th Int. Joint conference on Artificial Intelligence, 1983, pp. 272–279.
R. Reiter — A logic of default reasoning, in Artificial Intelligence 13, 1980, pp. 81–132.
D. Scott — completeness and axiomatizability in many valued logics, proceedings of Tarski symposium, L. Henkin et all editors AMS 1974, pp. 411–435.
R. Turner — Logics for Artificial Intelligence, Ellis Horwood 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabbay, D.M. (1985). Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems. In: Apt, K.R. (eds) Logics and Models of Concurrent Systems. NATO ASI Series, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82453-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-82453-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82455-5
Online ISBN: 978-3-642-82453-1
eBook Packages: Springer Book Archive