Limitations of Skeptical Default Reasoning
Artificial Intelligence
2013-02-08 v1
Abstract
Poole has shown that nonmonotonic logics do not handle the lottery paradox correctly. In this paper we will show that Pollock's theory of defeasible reasoning fails for the same reason: defeasible reasoning is incompatible with the skeptical notion of derivability.
Cite
@article{arxiv.1302.1536,
title = {Limitations of Skeptical Default Reasoning},
author = {Jens Doerpmund},
journal= {arXiv preprint arXiv:1302.1536},
year = {2013}
}
Comments
Appears in Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI1997)