AIFeb 6, 2013
Limitations of Skeptical Default Reasoning
arXiv:1302.1536v12 citations
Originality Synthesis-oriented
AI Analysis
This work addresses a theoretical limitation in defeasible reasoning for AI and logic communities, but it is incremental as it extends known issues to another framework.
The paper demonstrates that Pollock's theory of defeasible reasoning fails to correctly handle the lottery paradox, similar to Poole's findings on nonmonotonic logics, due to incompatibility with skeptical derivability.
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.