首页> 外文期刊>Theory and Practice of Logic Programming >Solving distributed constraint optimization problems using logic programming
【24h】

Solving distributed constraint optimization problems using logic programming

机译:使用逻辑编程解决分布式约束优化问题

获取原文
获取原文并翻译 | 示例

摘要

This paper explores the use of Answer Set Programming (ASP) in solving Distributed Constraint Optimization Problems (DCOPs). The paper provides the following novel contributions: (1) it shows how one can formulate DCOPs as logic programs; (2) it introduces ASP-DPOP, the first DCOP algorithm that is based on logic programming; (3) it experimentally shows that ASP-DPOP can be up to two orders of magnitude faster than DPOP (its imperative programming counterpart) as well as solve some problems that DPOP fails to solve, due to memory limitations; and (4) it demonstrates the applicability of ASP in a wide array of multi-agent problems currently modeled as DCOPs.
机译:本文探讨了答案集编程(ASP)在解决分布式约束优化问题(DCOP)中的用途。本文提供了以下新颖的贡献:(1)显示了如何将DCOP公式化为逻辑程序; (2)引入了ASP-DPOP,这是第一个基于逻辑编程的DCOP算法; (3)实验表明,ASP-DPOP可以比DPOP(它的命令式编程副本)快达两个数量级,并且可以解决由于内存限制而导致DPOP无法解决的一些问题; (4)证明了ASP在当前建模为DCOP的多种多主体问题中的适用性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号