Algorithms for decision problems in argument systems under preferred semantics

DOI10.1016/j.artint.2013.11.001zbMath1334.68210OpenAlexW2091587574MaRDI QIDQ490457

Samer Nofal, Paul E. Dunne, Katie Atkinson

Publication date: 27 August 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2013.11.001

zbMATH Keywords

algorithmsabstract argumentationcredulous acceptanceobjective acceptancepreferred extensionsskeptical acceptancesubjective acceptancevalue based argumentation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25)

Related Items (21)

An abstract argumentation and logic programming comparison based on 5-valued labellings ⋮ Optimization of dialectical outcomes in dialogical argumentation ⋮ Looking-ahead in backtracking algorithms for abstract argumentation ⋮ A Translation-Based Approach for Revision of Argumentation Frameworks ⋮ The first international competition on computational models of argumentation: results and analysis ⋮ Lattice point of view for argumentation framework ⋮ On checking skeptical and ideal admissibility in abstract argumentation frameworks ⋮ Taking account of the actions of others in value-based reasoning ⋮ Value-based argumentation framework built from prioritized qualitative choice logic ⋮ Constrained Value-Based Argumentation Framework ⋮ New stochastic local search approaches for computing preferred extensions of abstract argumentation ⋮ Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change ⋮ Unnamed Item ⋮ Encoding Argument Graphs in Logic ⋮ Opposition Frameworks ⋮ Pakota: A System for Enforcement in Abstract Argumentation ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ On the equivalence between logic programming semantics and argumentation semantics ⋮ Graded labellings for abstract argumentation ⋮ Indepth combinatorial analysis of admissible sets for abstract argumentation ⋮ Intertranslatability of Labeling-Based Argumentation Semantics

Uses Software

• ASPARTIX

Cites Work

• Unnamed Item
• Unnamed Item
• AFRA: argumentation framework with recursive attacks
• Algorithms and complexity results for persuasive argumentation
• Dynamics of argumentation systems: a division-based method
• Monadic second-order evaluations on tree-decomposable graphs
• Two party immediate response disputes: Properties and efficiency
• Using arguments for making and explaining decisions
• Reasoning about preferences in argumentation frameworks
• Audiences in argumentation frameworks
• Argumentation in artificial intelligence
• Computing ideal sceptical argumentation
• Computational properties of argument systems satisfying graph-theoretic constraints
• Argument based machine learning
• A reasoning model based on the production of acceptable arguments
• Towards fixed-parameter tractable algorithms for abstract argumentation
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• A logical account of formal argumentation
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Some Reflections on Two Current Trends in Formal Argumentation
• Metalevel argumentation
• Easy problems for tree-decomposable graphs
• Value-based Argumentation Frameworks as Neural-symbolic Learning Systems
• Preferred extensions as stable models
• An Algorithm for Computing Semi-stable Semantics
• Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation
• On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks
• Logics in Artificial Intelligence

This page was built for publication: Algorithms for decision problems in argument systems under preferred semantics