Looking-ahead in backtracking algorithms for abstract argumentation

DOI10.1016/J.IJAR.2016.07.013MaRDI QIDQ324699zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmsargument-based reasoningargumentation semantics

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

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

• scientific article; zbMATH DE number 1769206 (Why is no real title available?)
• A logical account of formal argumentation
• Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments
• Algorithms for decision problems in argument systems under preferred semantics
• An Algorithm for Computing Semi-stable Semantics
• Computational properties of argument systems satisfying graph-theoretic constraints
• Computing ideal sceptical argumentation
• Computing preferred extensions in abstract argumentation: a SAT-based approach
• Methods for solving reasoning problems in abstract argumentation -- a survey
• On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
• On kernels, defaults and even graphs
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Semi-stable semantics
• The first international competition on computational models of argumentation: results and analysis
• Theory and Applications of Satisfiability Testing
• Towards a common framework for dialectical proof procedures in abstract argumentation

Cited in

(9)

• Stochastic local search algorithms for abstract argumentation under stable semantics
• A general notion of equivalence for abstract argumentation
• Reduced meet over labelling-based semantics in abstract argumentation
• Design and results of the second international competition on computational models of argumentation
• Graded labellings for abstract argumentation
• The first international competition on computational models of argumentation: results and analysis
• On checking skeptical and ideal admissibility in abstract argumentation frameworks
• Pakota: a system for enforcement in abstract argumentation
• Lookahead-Based SMT Solving

Describes a project that uses

Uses Software

• MiniSat

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)