• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Workshop on Computational Logic in Multi-Agent Systems(CLIMA IV); 20040106-07; Fort Lauderdale,FL(US) >Symbolic Negotiation with Linear Logic
【24h】

Symbolic Negotiation with Linear Logic

机译：线性逻辑的符号协商

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. Previously it has been demonstrated how symbolic negotiation and distributed planning together could be formalised as distributed Linear Logic (LL) theorem proving. LL has been chosen mainly because of its expressive power for representation of resources and its computation-oriented nature. This paper extends the previous work by taking advantage of a richer fragment of LL and introducing two sorts of nondeterministic choices into negotiation. This allows agents to reason and negotiate under certain degree of uncertainty. Additionally, a way of granting unbounded access to resources during negotiation is considered. Finally we extend our framework with first-order LL for expressing more complex offers during negotiation.
机译：资源协商和多主体计划是多主体系统研究中的重要问题。以前已经证明了如何将符号协商和分布式规划一起形式化为分布式线性逻辑（LL）定理证明。选择LL主要是因为它具有表示资源的表现力和面向计算的性质。本文通过利用更丰富的LL片段并在协商中引入两种非确定性选择来扩展先前的工作。这使代理可以在一定程度的不确定性下进行推理和协商。另外，考虑了一种在协商期间授予对资源的无限制访问的方法。最后，我们使用一阶LL扩展了我们的框架，以便在协商过程中表达更复杂的要约。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号