The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Defeasible Reasoning
Open accessAbstract
What philosophers call defeasible reasoning is roughly the same as nonmonotonic reasoning in AI. Some brief remarks are made about the nature of reasoning and the relationship between work in epistemology, AI, and cognitive psychology. This is followed by a general description of human rational architecture. This description has the consequence that defeasible reasoning has a more complicated structure than has generally been recognized in AI. We define a proposition to be warranted if it would be believed by an ideal reasoner. A general theory of warrant, based on defeasible reasons, is developed. This theory is then used as a guide in the construction of a theory of defeasible reasoning, and a computer program implementing that theory. The theory constructed deals with only a subset of defeasible reasoning, but it is an important subset.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reiter, R. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90014-4 · Cited by 3,892
Circumscription—A form of non-monotonic reasoning
McCarthy, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90011-9 · Cited by 2,017
Doyle, J. (1979) · Artificial Intelligence · doi:10.1016/0004-3702(79)90008-0 · Cited by 1,132
McDermott, D., & Doyle, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90012-0 · Cited by 904
Contemporary Theories of Knowledge
Steo, W. (1962) · The Modern Schoolman · doi:10.5840/schoolman196239323 · Cited by 344
Nomic Probability and the Foundations of Induction.
Kyburg, H. E., & Pollock, J. L. (1993) · The Philosophical Review · doi:10.2307/2185665 · Cited by 119
Self-citationSchurz, G. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198887546.003.0002 · Cited by 50
Cited by
Dung, P. M. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00041-x · Cited by 4,270
Argumentation in artificial intelligence
Bench-Capon, T. J. M., & Dunne, P. E. (2007) · Artificial Intelligence · doi:10.1016/j.artint.2007.05.001 · Cited by 803
An abstract framework for argumentation with structured arguments
Prakken, H. (2010) · Argument & Computation · doi:10.1080/19462160903564592 · Cited by 670
An abstract, argumentation-theoretic approach to default reasoning
Bondarenko, A., Dung, P. M., Kowalski, R. A., & Toni, F. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00015-5 · Cited by 665
Argument-based extended logic programming with defeasible priorities
Prakken, H., & Sartor, G. (1997) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.1997.10510900 · Cited by 586
Probabilistic Horn abduction and Bayesian networks
Poole, D. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90061-f · Cited by 576
Reaching agreements through argumentation: a logical model and implementation
Kraus, S., Sycara, K., & Evenchik, A. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00078-2 · Cited by 524
Chesñevar, C. I., Maguitman, A. G., & Loui, R. P. (2000) · ACM Computing Surveys · doi:10.1145/371578.371581 · Cited by 518
Logics for Defeasible Argumentation
Prakken, H., & Vreeswijk, G. (2001) · Handbook of Philosophical Logic · doi:10.1007/978-94-017-0456-4_3 · Cited by 418
Lawrence, J., & Reed, C. (2020) · Computational Linguistics · doi:10.1162/coli_a_00364 · Cited by 396
The Carneades model of argument and burden of proof
Gordon, T. F., Prakken, H., & Walton, D. (2007) · Artificial Intelligence · doi:10.1016/j.artint.2007.04.010 · Cited by 393
Argumentation Mining: State of the Art and Emerging Trends
Lippi, M., & Torroni, P. (2016) · ACM Transactions on Internet Technology · doi:10.1145/2850417 · Cited by 363
Pollock, J. L. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90103-5 · Cited by 282
Self-citationPromoting Argument-Counterargument Integration in Students' Writing
Nussbaum, E. M., & Schraw, G. (2007) · The Journal of Experimental Education · doi:10.3200/jexe.76.1.59-92 · Cited by 279
Collaborative discourse, argumentation, and learning: Preface and literature review
Michael Nussbaum, E. (2008) · Contemporary Educational Psychology · doi:10.1016/j.cedpsych.2008.06.001 · Cited by 270
De Cruz, H. (2018) · doi:10.1017/9781108557849 · Cited by 24
Dialogic teaching of controversial issues: discursive moves to enact two-sided discussions
Shi, Y., Zhang, Z., Cao, S., & Liu, Q. (2024) · Language and Education · doi:10.1080/09500782.2023.2240292 · Cited by 11
Conciliationism as Epistemic Concession in Religious Peer Disagreement
Aslantatar, N. (2025) · İlahiyat Tetkikleri Dergisi · doi:10.29288/ilted.1657637 · Cited by 1
Metadata
- Authors
- Pollock, J. L.
- Venue
- Cognitive Science
- Publisher
- Wiley
- Published
- 1987-10
- Volume
- 11
- Issue
- 4
- Pages
- 481-518
- ISSN
- 0364-0213 (ISSN-L)
- 1551-6709
- OpenAlex
- W4256682192
- Cited by
- 522
- References
- 7
- FWCI
- 1.87
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.