Computable Models of the Law pp 219-238
Deterrence and Defeasibility in Argumentation Process for ALIS Project
- Cite this paper as:
- Rudnianski M., Bestougeff H. (2008) Deterrence and Defeasibility in Argumentation Process for ALIS Project. In: Casanovas P., Sartor G., Casellas N., Rubino R. (eds) Computable Models of the Law. Lecture Notes in Computer Science, vol 4884. Springer, Berlin, Heidelberg
Argumentation issues, which are of core importance to ALIS, are addressed through a particular category of qualitative games called Games of Deterrence. The graphs associated with those games are interpreted as sets of inferences sequences between statements in the framework of non-monotonic logic. Thus an argumentation process is interpreted as a game of deterrence, which resolution determines the truth or falsity of statements, and the possible argumentation strategies of the parties.
Keywordsacceptability ALIS argumentation attack consistency defeasibility game of deterrence graph of deterrence playability rebutting relevance strategy
Unable to display preview. Download preview PDF.