Hunter, A; (2013) Analysis of dialogical argumentation via finite state machines. In: Scalable Uncertainty Management. 7th International Conference, SUM 2013, Washington, DC, USA, September 16-18, 2013. Proceedings. (1 - 14). Springer Berlin Heidelberg

Preview

PDF minimax.pdf Available under License : See the attached licence file. Download (200kB)

Abstract

Dialogical argumentation is an important cognitive activity by which agents exchange arguments and counterarguments as part of some process such as discussion, debate, persuasion and negotiation. Whilst numerous formal systems have been proposed, there is a lack of frameworks for implementing and evaluating these proposals. First-order executable logic has been proposed as a general framework for specifying and analysing dialogical argumentation. In this paper, we investigate how we can implement systems for dialogical argumentation using propositional executable logic. Our approach is to present and evaluate an algorithm that generates a finite state machine that reflects a propositional executable logic specification for a dialogical argumentation together with an initial state. We also consider how the finite state machines can be analysed, with the minimax strategy being used as an illustration of the kinds of empirical analysis that can be undertaken. © 2013 Springer-Verlag Berlin Heidelberg.

Download activity - last month

Export as JSONXMLCSV

Download activity - last 12 months

Export as XMLCSVJSON

Downloads by country - last 12 months

Export as JSONCSVXML

Archive Staff Only

View Item