Solving Distributed Constraint Optimization Problems Using Logic Programming

Tiep Le, Tran Cao Son, Enrico Pontelli, William Yeoh
Computer Science Department, New Mexico State University


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).

PDF Version


journal = {Theory and Practice of Logic Programming},
publisher = {Cambridge University Press},
author = {Tiep Le and {Tran Cao} Son and Enrico Pontelli and William Yeo},
title = {Solving Distributed Constraint Optimization Problems Using Logic Programming},
note = {Special Issue on New Trends of Constraint Logic Programming},
editor= {Agostino Dovier},
volume = {17},
number = {4},
year = {2017},
pages = {634-683}