On the issue of contraposition of defeasible rules

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 2008. On the issue of contraposition of defeasible rules. Presented at: COMMA 2008, Toulouse, France, 28-30 May 2008. Published in: Besnard, P., Doutre, S. and Hunter, A. eds. Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008. Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008. , vol.172 Amsterdam: IOS Press, pp. 109-115.

Preview

PDF - Accepted Post-Print Version Download (66kB) | Preview

Abstract

The past ten years have shown a great variety of approaches for formal argumentation. An interesting question is to which extent these various formalisms correspond to the different application domains. That is, does the appropriate argumentation formalism depend on the particular domain of application, or does “one size fits all”. In this paper, we study this question from the perspective of one relatively simple design consideration: should or should there not be contrapostion of (or modus tollens) on defeasible rules. We aim to show that the answer depends on whether one is considering epistemical or constitutive reasoning, and that hence different domains require fundamentally different forms of defeasible reasoning.

Item Type:	Conference or Workshop Item (Paper)
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	IOS Press
ISBN:	9781586038595
Date of First Compliant Deposit:	13 July 2016
Last Modified:	31 Oct 2022 10:17
URI:	https://orca.cardiff.ac.uk/id/eprint/84295

Citation Data

Cited 16 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item