Looking-ahead in backtracking algorithms for abstract argumentation
From MaRDI portal
Publication:324699
DOI10.1016/J.IJAR.2016.07.013zbMATH Open1386.68161OpenAlexW2498770477MaRDI QIDQ324699FDOQ324699
Authors: Samer Nofal, Katie Atkinson, Paul E. Dunne 
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
Recommendations
- Algorithms for decision problems in argument systems under preferred semantics
- scientific article; zbMATH DE number 1769206
- On computing the set of acceptable arguments in abstract argumentation
- Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
Cites Work
- Theory and Applications of Satisfiability Testing
- Computing ideal sceptical argumentation
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Towards a common framework for dialectical proof procedures in abstract 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
- 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
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- Title not available (Why is that?)
- Algorithms for decision problems in argument systems under preferred semantics
- Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
- Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments
Cited In (8)
- Design and results of the second international competition on computational models of argumentation
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
- A general notion of equivalence for abstract argumentation
- Reduced meet over labelling-based semantics in abstract argumentation
- Pakota: A System for Enforcement in Abstract Argumentation
- The first international competition on computational models of argumentation: results and analysis
- Graded labellings for abstract argumentation
- Lookahead-Based SMT Solving
Uses Software
This page was built for publication: Looking-ahead in backtracking algorithms for abstract argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324699)
