A Logic of Argumentation for Reasoning Under Unertainty
Krause, PJ, Ambler, S, Elvang-Goransson, M and Fox, J (1995) A Logic of Argumentation for Reasoning Under Unertainty Computational Intelligence, 11. pp. 113-131.
![]() |
Text
CI LA Paper 1995.pdf Restricted to Repository staff only Download (77kB) |
Abstract
We present the syntax and proof theory of a logic of argumentation, LA. We also outline the development of a category theoretic semantics for LA. LA is the core of a proof theoretic model for reasoning under uncertainty. In this logic, propositions are labelled with a representation of the arguments which support their validity. Arguments may then be aggregated to collect more information about the potential validity of the propositions of interest. We make the notion of aggregation primitive to the logic, and then define strength mappings from sets of arguments to one of a number of possible dictionaries. This provides a uniform framework which incorporates a number of numerical and symbolic techniques for assigning subjective confidences to propositions on the basis of their supporting arguments. These aggregation techniques are also described, with examples
Item Type: | Article |
---|---|
Divisions : | Surrey research (other units) |
Authors : | Krause, PJ, Ambler, S, Elvang-Goransson, M and Fox, J |
Date : | 1995 |
Uncontrolled Keywords : | Reasoning under Uncertainty, Epistemic probability, argumentation, non-classical logics, non-monotonic reasoning |
Depositing User : | Symplectic Elements |
Date Deposited : | 28 Mar 2017 14:09 |
Last Modified : | 24 Jan 2020 11:47 |
URI: | http://epubs.surrey.ac.uk/id/eprint/719396 |
Actions (login required)
![]() |
View Item |
Downloads
Downloads per month over past year