ML Anthology

Limitations of Skeptical Default Reasoning

Jens Doerpmund
UAI 1997 pp. 150-156
/uai/1997/doerpmund1997uai-limitations/

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.

PDF UAI Semantic Scholar

Cite

Text

Doerpmund. "Limitations of Skeptical Default Reasoning." Conference on Uncertainty in Artificial Intelligence, 1997.

Markdown

[Doerpmund. "Limitations of Skeptical Default Reasoning." Conference on Uncertainty in Artificial Intelligence, 1997.](https://mlanthology.org/uai/1997/doerpmund1997uai-limitations/)

BibTeX

@inproceedings{doerpmund1997uai-limitations,
  title     = {{Limitations of Skeptical Default Reasoning}},
  author    = {Doerpmund, Jens},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1997},
  pages     = {150-156},
  url       = {https://mlanthology.org/uai/1997/doerpmund1997uai-limitations/}
}