arXiv · 1705.03916
Solving Distributed Constraint Optimization Problems Using Logic Programming
Abstract
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. Under consideration in Theory and Practice of Logic Programming (TPLP).
Explore related subjects
Keep this discovery
Tiep Le, Tran Cao Son, Enrico Pontelli, William Yeoh. 2017-05-10. Solving Distributed Constraint Optimization Problems Using Logic Programming. https://arxiv.org/abs/1705.03916
Cite the original work for its findings. Save a collection to share your selection of sources.