Social Argumentation Semantics

A social argumentation semantics is a tuple ⟨L,τ,⋏,⋎,¬⟩\langle L, \tau, \curlywedge, \curlyvee, \neg \rangle, where LL is a totally ordered set with top ⊤\top and bottom ⊥\bot, τ\tau gives each argument a base score in LL, ⋎ ⁣:L×L→L\curlyvee \colon L \times L \to L aggregates the values of the attackers, ⋏ ⁣:L×L→L\curlywedge \colon L \times L \to L combines the base score with the negated aggregate, and ¬ ⁣:L→L\neg \colon L \to L is a negation.

Reference

Leite, J. & Martins, J.G. (2011). Social Abstract Argumentation. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 2287–2292. AAAI Press.

Referenced by