On checking skeptical and ideal admissibility in abstract argumentation frameworks

DOI10.1016/J.IPL.2019.03.013MaRDI QIDQ2419797zbMATH OpenOpenAlexFDO

Authors Samer Nofal, Katie Atkinson, Paul E. Dunne

Publication date 4 June 2019

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2019.03.013

zbMATH Keywords

argumentation semanticsargumentation graph

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• Computing ideal sceptical argumentation
• On computing the set of acceptable arguments in abstract argumentation
• The computational complexity of ideal semantics
• scientific article; zbMATH DE number 6902516
• Complexity-sensitive decision procedures for abstract argumentation

Cites work

• scientific article; zbMATH DE number 1769206 (Why is no real title available?)
• A forward propagation algorithm for the computation of the semantics of argumentation frameworks
• Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments
• Algorithms for decision problems in argument systems under preferred semantics
• Argumentation in artificial intelligence
• Coherence in finite argument systems.
• Computational properties of argument systems satisfying graph-theoretic constraints
• Looking-ahead in backtracking algorithms for abstract argumentation
• Methods for solving reasoning problems in abstract argumentation -- a survey
• On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• The computational complexity of ideal semantics
• The first international competition on computational models of argumentation: results and analysis
• Towards a common framework for dialectical proof procedures in abstract argumentation

Cited in

(7)

• Indepth combinatorial analysis of admissible sets for abstract argumentation
• Guaranteeing Admissibility of Abstract Argumentation Frameworks with Rationality and Feasibility Constraints
• Computing ideal sceptical argumentation
• Logics in Artificial Intelligence
• Lattice point of view for argumentation framework
• Looking-ahead in backtracking algorithms for abstract argumentation
• Computing strongly admissible sets

Describes a project that uses

Uses Software

• pyglaf

This page was built for publication: On checking skeptical and ideal admissibility in abstract argumentation frameworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419797)