Encoding Argument Graphs in Logic

DOI10.1007/978-3-319-08855-6_35zbMath1418.68191OpenAlexW3927449MaRDI QIDQ5230074

Andreas Herzig, Sylvie Doutre, Philippe Besnard

Publication date: 20 August 2019

Published in: Information Processing and Management of Uncertainty in Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL: http://publications.ut-capitole.fr/29860/1/Besnard_12983.pdf

zbMATH Keywords

dynamic logicconstraint satisfaction problemargumentation frameworkargument systemabstract argument

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (4)

Optimization of dialectical outcomes in dialogical argumentation ⋮ A Translation-Based Approach for Revision of Argumentation Frameworks ⋮ RAFDivider  : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks ⋮ Dynamic epistemic logics for abstract argumentation

Cites Work

• Unnamed Item
• Finding kernels or solving SAT
• Algorithms for decision problems in argument systems under preferred semantics
• On principle-based evaluation of extension-based argumentation semantics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Argumentation frameworks as constraint satisfaction problems
• Methods for solving reasoning problems in abstract argumentation -- a survey
• A QBF-based formalization of abstract argumentation semantics
• SCC-recursiveness: a general schema for argumentation semantics
• The Same, Similar, or Just Completely Different? Equivalence for Argumentation in Light of Logic
• Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change

This page was built for publication: Encoding Argument Graphs in Logic