Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Reaching agreements through argumentation: a logical model and implementation
Artificial Intelligence
Argumentation as distributed constraint satisfaction: applications and results
Proceedings of the fifth international conference on Autonomous agents
Fuzzy argumentation for negotiating agents
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Inferring from Inconsistency in Preference-Based Argumentation Frameworks
Journal of Automated Reasoning
Probabilistic argumentation systems a new way to combine logic with probability
Journal of Applied Logic - Special issue on combining probability and logic
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Soft concurrent constraint programming
ACM Transactions on Computational Logic (TOCL)
A survey of trust and reputation systems for online service provision
Decision Support Systems
Propagating multitrust within trust networks
Proceedings of the 2008 ACM symposium on Applied computing
On bipolarity in argumentation frameworks
International Journal of Intelligent Systems - Bipolar Representations of Information and Preference Part 2: Reasoning and Learning
Possibilistic-Based Argumentation: An Answer Set Programming Approach
ENC '08 Proceedings of the 2008 Mexican International Conference on Computer Science
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Reasoning about preferences in argumentation frameworks
Artificial Intelligence
Inconsistency tolerance in weighted argument systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
A Common Computational Framework for Semiring-based Argumentation Systems
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Modeling and solving AFs with a constraint-based tool: conarg
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
| Hi-index | 0.00 |
We suggest soft constraints as a mean to parametrically represent and solve "weighted" Argumentation problems: different kinds of preference levels related to arguments, e.g. a score representing a "fuzziness", a "cost" or a probability level of each argument, can be represented by choosing different semiring algebraic structures. The novel idea is to provide a common computational and quantitative framework where the computation of the classical Dung's extensions, e.g. the admissible extension, has an associated score representing "how much good" the set is. Preference values associated to arguments are clearly more informative and can be used to prefer a given set of arguments over others with the same characteristics (e.g. admissibility). Moreover, we propose a mapping from weighted Argumentation Frameworks to Soft Constraint Satisfaction Problems (SCSPs); with this mapping we can compute Dung semantics (e.g. admissible and stable) by solving the related SCSP. To implement this mapping we use JaCoP, a Java constraint solver.