Abstract
One of the most striking features of ludics is that it provides us with convenient tools for the modelling of interaction. As a consequence, ludics can be employed as a potential framework for the study of dialogues. In this paper we address some of the issues that arise when one tries to model certain types of dialogues that occur in the field of argumentation. We shall exploit that ludics’ designs can be regarded as abstract Böhm trees and explain how the pointer interaction of the associated geometric abstract machine relates to a notion of backtracking.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Basaldella, M., Faggian, C.: Ludics with repetitions (exponentials, interactive types and completeness). Logical Methods in Computer Science 7(2:13), 1–85 (2011)
Curien, P.-L., Herbelin, H.: Abstract machines for dialogue games. In: Interactive Models of Computation and Program Behavior. Panoramas et Sythèses, vol. 27, pp. 231–275. SMF (2009)
Lecomte, A., Quatrini, M.: Ludics and Its Applications to Natural Language Semantics. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS (LNAI), vol. 5514, pp. 242–255. Springer, Heidelberg (2009)
Prakken, H., Reed, C., Walton, D.: Dialogues about the burden of proof. In: Proceedings of the 10th International Conference on Artificial Intelligence and Law, ICAIL 2005, pp. 115–124. ACM (2005)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ranalter, K. (2012). Abstract Machines for Argumentation. In: Béchet, D., Dikovsky, A. (eds) Logical Aspects of Computational Linguistics. LACL 2012. Lecture Notes in Computer Science, vol 7351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31262-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-31262-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31261-8
Online ISBN: 978-3-642-31262-5
eBook Packages: Computer ScienceComputer Science (R0)