Artificial Intelligence
The Logical Handling of Threats, Rewards, Tips, and Warnings
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A formal analysis of interest-based negotiation
Annals of Mathematics and Artificial Intelligence
Argumentation-based negotiation planning for autonomous agents
Decision Support Systems
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Current logic-based handling of arguments has mainly focused on explanation or justification-oriented purposes in presence of inconsistency. So only one type of argument has been considered, and several argumentation frameworks have then been proposed for generating and evaluating such arguments. However, recent works on argumentation-based negotiation have emphasized different other types of arguments such as threats, rewards, and appeals. The purpose of this article is to provide a logical setting that encompasses the classical argumentation-based framework and handles the new types of arguments. More precisely, we give the logical definitions of these arguments and their weighting systems. These definitions take into account that negotiation dialogues involve not only agents' beliefs (of various strengths), but also their goals (having maybe different priorities), as well as the beliefs on the goals of other agents. In other words, from the different beliefs and goals bases maintained by agents, all the possible threats, rewards, explanations, and appeals that are associated with them can be generated. It may also happen that an intended threat, or reward, is not perceived as such by the addressee and thus misses its target because the addresser misrepresents the addressee's goals. The proposed approach accounts for that phenomenon. Finally, we show how to evaluate conflicting arguments of different types. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 1195–1218, 2005.