2000 character limit reached
Limitations of Skeptical Default Reasoning (1302.1536v1)
Published 6 Feb 2013 in cs.AI
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.