Looking-ahead in backtracking algorithms for abstract argumentation
From MaRDI portal
Publication:324699
DOI10.1016/J.IJAR.2016.07.013zbMath1386.68161OpenAlexW2498770477MaRDI QIDQ324699
Paul E. Dunne, Katie Atkinson, Samer Nofal
Publication date: 17 October 2016
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2016.07.013
Related Items (6)
The first international competition on computational models of argumentation: results and analysis ⋮ On checking skeptical and ideal admissibility in abstract argumentation frameworks ⋮ Design and results of the second international competition on computational models of argumentation ⋮ Pakota: A System for Enforcement in Abstract Argumentation ⋮ A general notion of equivalence for abstract argumentation ⋮ Graded labellings for abstract argumentation
Uses Software
Cites Work
- Unnamed Item
- Algorithms for decision problems in argument systems under preferred semantics
- Computing ideal sceptical argumentation
- Computational properties of argument systems satisfying graph-theoretic constraints
- On kernels, defaults and even graphs
- The first international competition on computational models of argumentation: results and analysis
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- A logical account of formal argumentation
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Semi-stable semantics
- 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
- Theory and Applications of Satisfiability Testing
- Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
- Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments
This page was built for publication: Looking-ahead in backtracking algorithms for abstract argumentation