Negotiation Using Logic Programming with Consistency Restoring Rules
Tran Cao Son and Chiaki Sakama
Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pages 930-935, 2009.
We formalize negotiations using logic programming with
consistency restoring rules (or CR-Prolog)
[Balduccini and Gelfond, 2003].
Our formulation deals with incomplete information, preferences, and
We assume that each agent is equipped with a
knowledge base for negotiation
which consists of a CR-program,
a set of possible assumptions,
and a set of ordered goals. We use the notion of an answer set
as a means to formalize
the basic notions of negotiation such
as proposal, response, negotiation, negotiation tree
and discuss their properties.
Full Paper (PDF 203K) © IJCAI
Slide (pdf 428K)