On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
type: Item
instance of: scholarly article
title: On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
zbMATH Open document ID: 1451.68265
author: Claudia Schulz
author: Francesca Toni
published in: Artificial Intelligence
publication date: 2019-01-18T00:00:00Z
full work available at URL: http://hdl.handle.net/10044/1/62024
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 7003571
zbMATH Keywords: abstract argumentation
zbMATH Keywords: stable semantics
zbMATH Keywords: preferred semantics
zbMATH Keywords: non-existence
zbMATH Keywords: undecidedness
zbMATH Keywords: inconsistency
zbMATH Keywords: dynamics
zbMATH Keywords: debugging
Wikidata QID: Q62042292
MaRDI profile type: Publication
OpenAlex ID: W2884696316
cites work: Using arguments for making and explaining decisions
cites work: An approach to decision making based on dynamic argumentation systems
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: A logical account of formal argumentation
cites work: Probabilistic Reasoning with Abstract Argumentation Frameworks
cites work: SCC-recursiveness: a general schema for argumentation semantics
cites work: On the input/output behavior of argumentation frameworks
cites work: Q3457206
cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty
cites work: On the Maximal and Average Numbers of Stable Extensions
cites work: Coherence in finite argument systems.
cites work: I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation
cites work: A theory of diagnosis from first principles
cites work: Stage semantics and the SCC-recursive schema for argumentation semantics
cites work: On the acceptance of loops in argumentation frameworks
cites work: The handling of loops in argumentation networks
cites work: Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack
cites work: Dilemmas and paradoxes: cycles in argumentation frameworks
cites work: The role of self-attacking arguments in characterizations of equivalence notions
cites work: Toward incremental computation of argumentation semantics: a decomposition-based approach
cites work: Splitting an Argumentation Framework
cites work: Parameterized Splitting: A Simple Modification-Based Approach
cites work: Change in Abstract Argumentation Frameworks: Adding an Argument
cites work: Dynamics of argumentation systems: a division-based method
cites work: Rewriting Rules for the Computation of Goal-Oriented Changes in an Argumentation System
cites work: Q5282962
cites work: A Translation-Based Approach for Revision of Argumentation Frameworks
cites work: Methods for solving reasoning problems in abstract argumentation -- a survey
cites work: Complete extensions in argumentation coincide with 3-valued stable models in logic programming
cites work: On the equivalence between logic programming semantics and argumentation semantics
cites work: Catching the Ouroboros: On debugging non-ground answer-set programs
cites work: Stepping through an Answer-Set Program
cites work: Characterising and Explaining Inconsistency in Logic Programs
cites work: Measuring Inconsistency in Answer Set Programs
cites work: Q5715696
cites work: A Game-Theoretic Measure of Argument Strength for Abstract Argumentation
cites work: Q3455611
DOI: 10.1016/J.ARTINT.2018.07.001
description: scientific article; zbMATH DE number 7003571