Argumentation

, Volume 17, Issue 4, pp 421–450

Computational Dialogic Defeasible Reasoning

Authors

  • Robert L. Causey
    • Department of PhilosophyUniversity of Texas at Austin
Article

DOI: 10.1023/A:1026342520498

Cite this article as:
Causey, R.L. Argumentation (2003) 17: 421. doi:10.1023/A:1026342520498

Abstract

This article begins with an introduction to defeasible (nonmonotonic) reasoning and a brief description of a computer program, EVID, which can perform such reasoning. I then explain, and illustrate with examples, how this program can be applied in computational representations of ordinary dialogic argumentation. The program represents the beliefs and doubts of the dialoguers, and uses these propositional attitudes, which can include commonsense defeasible inference rules, to infer various changing conclusions as a dialogue progresses. It is proposed that computational representations of this kind are a useful tool in the analysis of dialogic argumentation, and, in particular, demonstrate the important role of defeasible reasoning in everyday arguments using commonsense reasoning.

commonsense reasoning computational logic defeasible reasoning dialogue logic nonmonotonic reasoning rhetoric

Copyright information

© Kluwer Academic Publishers 2003