Abstract
A new version of Reiter's Default Logic is developed which has a number of advantages: it is computationally much simpler and has some more intuitive properties, such as cumulativity. Furthermore, it is shown that this Default Logic is a limiting case of a Dempster-Shafer framework, thereby demonstrating a strong connection between two apparently very different approaches to reasoning with uncertainty, and opening up the possibility of mixing default and numerical rules within the same framework.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Adams, E., 75, The Logic of Conditionals, Reidel, Boston.
Bernouilli, J., 1713, Ars Conjectandi, Basel. Reprinted in 1968 by Culture et Civilisation, Brussels.
Besnard, Philippe, 89, An Introduction to Default Logic, Symbolic Computation— Artificial Intelligence, Springer-Verlag, Berlin, Heidelberg, New York.
Brewka, G., 91, Cumulative Default Logic: In Defense of Nonmonotonic Inference Rules, Artificial Intelligence 50, 183–205.
Dempster, A. P., 67, Upper and Lower Probabilities Induced by a Multi-valued Mapping. Ann. Math. Statistics 38: 325–339.
Geffner, H., 89, Default Reasoning: Causal and Conditional Theories, PhD thesis, Computer Science Department, UCLA, Los Angeles, CA90024, November 89.
Hacking, I., 75, The Emergence of Probability, Cambridge University Press, London.
Lukacewicz, 84, Considerations on Default Logic, Proc. Non Monotonic Reasoning Workshop, New Paltz NY, pp165–193; also, 1988, Computational Intelligence 4, pp1–16.
Makinson, D., 90, General Patterns in Nonmonotonic Reasoning, Chapter 2.2 of Vol II of Handbook of Logic in Artificial Intelligence and Logic Programming.
Pearl, Judea, 88, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann Publishers Inc.
Poole, D., 88, A Logical Framework for Default Reasoning, Artificial Intelligence, 36: 27–47.
Reiter, R., 80, A Logic for Default Reasoning, Artificial Intelligence 13 (1, 2), pp81–132.
Shafer, G., 76, A Mathematical Theory of Evidence, Princeton University Press, Princeton, NJ.
Shafer, G., 78, Non-Additive Probabilities in the Work of Bernouilli and Lambert, Archive for History of Exact Sciences 19: 309–370.
Wilson, Nic, 89, Justification, Computational Efficiency and Generalisation of the Dempster-Shafer Theory, Research Report no. 15, June 1989, Dept. of Computing and Mathematical Sciences, Oxford Polytechnic, to appear in Artificial Intelligence.
Wilson, Nic, 90a, Default Logic and Belief Functions, Proceedings DRUMS Workshop on Non-monotonic Logic, Luminy, France, February 1990.
Wilson, Nic, 90b, Rules, Belief Functions and Default Logic, in Bonissone, P., and Henrion, M., 90, eds Proc. 6th Conference on Uncertainty in Artificial Intelligence, MIT, Cambridge, Mass.
Wilson, Nic, 92, Some Theoretical Aspects of the Dempster-Shafer Theory, PhD thesis, May 1992.
Wilson, Nic, 93, Default Logic and Dempster-Shafer Theory, unpublished manuscript (longer version of current paper).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilson, N. (1993). Default logic and Dempster-Shafer theory. In: Clarke, M., Kruse, R., Moral, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1993. Lecture Notes in Computer Science, vol 747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028223
Download citation
DOI: https://doi.org/10.1007/BFb0028223
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57395-1
Online ISBN: 978-3-540-48130-0
eBook Packages: Springer Book Archive