Argumentation frameworks as constraint satisfaction problems

DOI10.1007/S10472-013-9343-0MaRDI QIDQ2248522zbMATH OpenOpenAlexFDO

Authors Leila Amgoud, Caroline Devred

Publication date 26 June 2014

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-013-9343-0

zbMATH Keywords

argumentationCSPnonmonotonic reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Recommendations

• Solving weighted argumentation frameworks with soft constraints
• Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks
• On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
• Representing argumentation frameworks in answer set programming
• Complexity-sensitive decision procedures for abstract argumentation

Cites work

• A Common Computational Framework for Semiring-based Argumentation Systems
• A comparison between SAT and CSP techniques
• A reasoning model based on the production of acceptable arguments
• An optimal k-consistency algorithm
• Answer set programming and plan generation
• Answer-set programming encodings for argumentation frameworks
• Computational properties of argument systems satisfying graph-theoretic constraints
• Computing ideal sceptical argumentation
• Generating possible intentions with constrained argumentation systems
• Handbook of constraint programming.
• scientific article; zbMATH DE number 4166937 (Why is no real title available?)
• scientific article; zbMATH DE number 2080324 (Why is no real title available?)
• Network flow and 2-satisfiability
• 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
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
• The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary

Cited in

(17)

• Pakota: a system for enforcement in abstract argumentation
• Coalitions of arguments: an approach with constraint programming
• Advanced SAT techniques for abstract argumentation
• RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
• Solving weighted argumentation frameworks with soft constraints
• Answer-set programming encodings for argumentation frameworks
• Preferred extensions as stable models
• On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
• Solving set optimization problems by cardinality optimization with an application to argumentation
• Constrained Value-Based Argumentation Framework
• Reduction-based approaches to implement Modgil's extended argumentation frameworks
• Argumentation reasoning via circumscription with \textsc{pyglaf}
• Encoding argument graphs in logic
• scientific article; zbMATH DE number 6747868 (Why is no real title available?)
• The complexity landscape of claim-augmented argumentation frameworks
• Value-based argumentation framework built from prioritized qualitative choice logic
• Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks

Describes a project that uses

Uses Software

• ASPARTIX

This page was built for publication: Argumentation frameworks as constraint satisfaction problems

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