2013/02/06 by Jens Doerpmund, Doerpmund, Jens
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #cs.AI
paper · pdf · doi:10.48550/arxiv.1302.1536
Appears in Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI1997)
arxiv created 2013/02/06 · arxiv updated 2013/02/08
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.