Negotiation Using Logic Programming with Consistency Restoring Rules
Negotiation Using Logic Programming with Consistency Restoring Rules
复制标题
DOI：
--
复制
发表时间：
2009-07
期刊：
影响因子：
--
通讯作者：
Tran Cao Son;Chiaki Sakama
中科院分区：
文献类型：
--
作者：
Tran Cao Son;Chiaki Sakama
我们使用具有一致性恢复规则（或CR-Prolog）的逻辑编程来形式化协商[Balduccini和Gelfond，2003]。我们的公式处理不完整的信息，偏好和不断变化的目标。我们假设，每个代理都配备了一个知识库的谈判，其中包括一个CR程序，一组可能的假设，和一组有序的目标。我们使用的答案集的概念作为一种手段，以形式化的谈判，如建议，响应，谈判，谈判树（协议）等的基本概念，并讨论它们的属性。
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 changing goals. 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 (protocol), etc. and discuss their properties.