Computational models of argument : proceedings of COMMA 2014 / edited by Simon Parsons, University of Liverpool, UK, Nir Oren, University of Aberdeen, Scotland, Chris Reed, University of Dundee, Scotland, and Federico Cerutti, University of Aberdeen, Scotland.

Includes bibliographical references and index.

Vendor-supplied metadata.

Title Page -- Preface -- Programme Committee -- Contents -- Invited Papers -- On the Properties of the Relation Between Argumentation Semantics and Argumentation Inference Operators -- Innovative Applications -- Understanding Narratives with Argumentation -- Financial Dialogue Games: A Protocol for Earnings Conference Calls -- Story Comprehension Through Argumentation -- A Discourse Grammar for Processing Arguments in Context -- Spoken Interaction with Broadcast Debates -- Lakatos Games for Mathematical Argument

Towards Argumentation for Statistical Model SelectionRegular Papers -- Preferential Reasoning Based on Abstract Argumentation Semantics -- Dynamic Derivations for Sequent-Based Logical Argumentation -- Query Failure Explanation in Inconsistent Knowledge Bases Using Argumentation -- Taking the Long View: Looking Ahead in Practical Reasoning -- On Rationality Conditions for Epistemic Probabilities in Abstract Argumentation -- Towards an Integrated Theory of Causal Scenarios and Evidential Arguments -- Generalising Argument Dialogue with the Dialogue Game Execution Platform

Benchmarking Hard Problems in Random Abstract AFs: The Stable SemanticsCoalitional Games for Abstract Argumentation -- Complexity Properties of Critical Sets of Arguments -- Towards Argument Mining from Dialogue -- Strong Admissibility Revisited -- Preferences and Unrestricted Rebut -- Algorithm Selection for Preferred Extensions Enumeration -- The DIAMOND System for Computing with Abstract Dialectical Frameworks -- Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas -- Multi-Valued and Probabilistic Argumentation Frameworks

Properties of Random VAFs and Implications for Efficient AlgorithmsResolution-Based Grounded Semantics Revisited -- Decomposing Abstract Dialectical Frameworks -- A Principled Approach to the Implementation of Argumentation Models -- Combining Paraconsistent Logic with Argumentation -- Probabilistic Argument Graphs for Argumentation Lotteries -- Enthymeme Construction in Dialogues Using Shared Knowledge -- Strategies in Dialogues: A Game-Theoretic Approach -- Argumentation Logic -- Splitting Abstract Dialectical Frameworks

Revisiting Support in Abstract Argumentation SystemsA Self-Correcting Iteration Schema for Argumentation Networks -- Counterfactual Reasoning in Argumentation Frameworks -- Balanced Semantics for Argumentation Based on Heider's Socio-Psychological Balance Theory -- Complete Assumption Labellings -- On Controversiality of Arguments and Stratified Labelings -- An ASPIC-Based Legal Argumentation Framework for Deontic Reasoning -- Arguments and Their Strength: Revisiting Pollock's Anti-Probabilistic Starting Points -- Demonstrations

Argumentation, which has long been a topic of study in philosophy, has become a well-established aspect of computing science in the last 20 years. This book presents the proceedings of the fifth conference on Computational Models of Argument (COMMA), held in Pitlochry, Scotland in September 2014. Work on argumentation is broad, but the COMMA community is distinguished by virtue of its focus on the computational and mathematical aspects of the subject. This focus aims to ensure that methods are sound - that they identify arguments that are correct in some sense - and provide an unambiguous speci.

eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide