Computational models of argument : Proceedings of COMMA 2022 /
COMMA 2022
edited by Francesca Toni [and more.
- Amsterdam : IOS Press, (c)2022.
- 1 online resource (400 pages).
- Frontiers in Artificial Intelligence and Applications ; v. 353 .
Includes bibliographies and index.
Intro -- Title Page -- Preface -- About the Conference -- Invited Talks -- Well, to Be Honest, I Wouldnt Start from Here at All (A Personal View of Complexity in Argumentation After 20 Years) -- Detect -- Debunk -- Communicate: Combating Misinformation with More Realistic NLP -- Argumentation: From Theory to Practice and Back -- Regular Papers -- Generating Contrastive Snippets for Argument Search -- Explainable Logic-Based Argumentation -- Admissibility in Strength-Based Argumentation: Complexity and Algorithms -- A Generalized Notion of Consistency with Applications to Formal Argumentation Argument Schemes for Factor Ascription -- Serialisable Semantics for Abstract Argumentation -- Abstract Argumentation with Conditional Preferences -- A Ranking Semantics for Abstract Argumentation Based on Serialisability -- NEXAS: A Visual Tool for Navigating and Exploring Argumentation Solution Spaces -- Non-Admissibility in Abstract Argumentation. New Loop Semantics, Overview, Complexity Analysis -- Treewidth for Argumentation Frameworks with Collective Attacks -- Rule-PSAT: Relaxing Rule Constraints in Probabilistic Assumption-Based Argumentation Composite Argumentation Systems with ML Components -- Automated Reasoning with Epistemic Graphs Using SAT Solvers -- Explaining Change in Quantitative Bipolar Argumentation -- How Complex Is the Strong Admissibility Semantics for Abstract Dialectical Frameworks? -- Just a Matter of Perspective. Intertranslating Expressive Argumentation Formalisms -- On the Impact of Data Selection when Applying Machine Learning in Abstract Argumentation -- Algorithms for Reasoning in a Default Logic Instantiation of Assumption-Based Argumentation -- Value-Based Practical Reasoning: Modal Logic + Argumentation On the Complexity of Determining Defeat Relations Consistent with Abstract Argumentation Semantics -- Stability and Relevance in Incomplete Argumentation Frameworks -- Arguing About the Existence of Conflicts -- Formalising an Aspect of Argument Strength: Degrees of Attackability -- Ordinal Conditional Functions for Abstract Argumentation -- Strongly Accepting Subframeworks: Connecting Abstract and Structured Argumentation -- Reasoning With and About Norms in Logical Argumentation -- Demo Papers -- An Argumentative Explanation of Machine Learning Outcomes PyArg for Solving and Explaining Argumentation in Python: Demonstration -- Providing Explanations via the EQR Argument Scheme -- EGNN: A Deep Reinforcement Learning Architecture for Enforcement Heuristics -- ADF-BDD: An ADF Solver Based on Binary Decision Diagrams -- Annotating Very Large Arguments -- CPrAA -- A Checker for Probabilistic Abstract Argumentation -- COGNICA: Cognitive Argumentation -- probo2: A Benchmark Framework for Argumentation Solvers -- Polemicist: A Dialogical Interface for Exploring Complex Debates -- User-Centric Argument Mining with ArgueMapper and Arguebuf Attractor -- A Java Library for Gradual Bipolar Argumentation