Multiagent compromise via negotiation
Distributed Artificial Intelligence (Vol. 2)
A mathematical treatment of defeasible reasoning and its implementation
Artificial Intelligence
Reaching agreements through argumentation: a logical model and implementation
Artificial Intelligence
ACM Computing Surveys (CSUR)
Bargaining with limited computation: deliberation equilibrium
Artificial Intelligence
Cognitive Carpentry: A Blueprint for how to Build a Person
Cognitive Carpentry: A Blueprint for how to Build a Person
Explanations, belief revision and defeasible reasoning
Artificial Intelligence
Relating defeasible and normal logic programming through transformation properties
Theoretical Computer Science
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
On the comparison of theories: preferring the most specific explanation
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
Negotiation can be conceived as the exchange of messages among self-interested agents in order to settle on an agreement over a given issue. They decide which messages to send according to their preferences and their evolving beliefs. Agents able to handle this dynamics of messages and beliefs can be represented by means of Defeasible Logic Programming augmented with utility functions. This approach to argumentation has the advantage of providing a useful platform for the representation of beliefs and the generation of messages. The interactive nature of negotiations requires an updating mechanism to be applied over the knowledge bases of the agents. The features of this mechanism are described by a protocol of a negotiation. Although there are many possible protocols, we concentrate on one that ensures the existence of an agreement in negotiations. The formalism of DeLP provides a very natural approach to the characterization of such a protocol.