Researchers have introduced a new family of dialogue-based semantics called "tenability" to model how arguments can be defended in debates. Unlike existing weak semantics that require uniform defense against all reasonable counterarguments, tenability allows for strategic responses based on the opponent's attack. Three variants—static tenability, tenability, and strong tenability—are defined through commitment games, offering different obligations for disputants. The paper also analyzes the computational complexity of deciding these semantics, with static tenability being $\Pi^P_2$-complete and the other two being PSPACE-complete. AI
RANK_REASON This is a research paper introducing new formal semantics for argumentation. [lever_c_demoted from research: ic=1 ai=1.0]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
