Arguing with Confidential Information

Oren, Nir, Norman, Timothy J. and Preece, Alun David ORCID: https://orcid.org/0000-0003-0349-9057 2006. Arguing with Confidential Information. Presented at: ECAI 2006: 17th European Conference on Artificial Intelligence, Riva del Garda, Italy, 29 August - 1 September 2006. Published in: Brewka, Gerhard, Coradeschi, S., Perini, A. and Traverso, P. eds. ECAI 2006: 17th European Conference on Artificial Intelligence, including Prestigious Applications of Intelligent Systems (PAIS 2006): proceedings. Frontiers in Artificial Intelligence and Applications , vol.141 Amsterdam: IOS Press, pp. 280-284.

Full text not available from this repository.

Abstract

While researchers have looked at many aspects of argumentation, an area often neglected is that of argumentation strategies. That is, given multiple possible arguments that an agent can put forth, which should be selected in what circumstances. In this paper, we propose a heuristic that implements one such strategy. The heuristic assigns a utility cost to revealing information, as well as a utility to winning, drawing and losing an argument. An agent participating in a dialogue then attempts to maximise its utility. We present a formal argumentation framework in which this heuristic may operate, and show how it functions within the framework. Finally, we discuss how this heuristic may be extended in future work, and its relevance to argumentation theory in general.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	IOS Press
ISBN:	9781586036423
Related URLs:	Publisher Organisation Publisher
Last Modified:	24 Oct 2022 10:55
URI:	https://orca.cardiff.ac.uk/id/eprint/46416

Citation Data

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

Actions (repository staff only)

Edit Item