Solving Distributed Constraint Optimization Problems Using Logic Programming

Authors

  • Tiep Le New Mexico State University
  • Tran Son New Mexico State University
  • Enrico Pontelli New Mexico State University
  • William Yeoh New Mexico State University

DOI:

https://doi.org/10.1609/aaai.v29i1.9365

Keywords:

DCOP, answer set programming

Abstract

This paper explores the use of answer set programming (ASP) in solving distributed constraint optimization problems (DCOPs). It makes the following contributions: (i)~It shows how one can formulate DCOPs as logic programs; (ii)~It introduces ASP-DPOP, the first DCOP algorithm that is based on logic programming; (iii)~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 (iv)~It demonstrates the applicability of ASP in the wide array of multi-agent problems currently modeled as DCOPs.

Downloads

Published

2015-02-16

How to Cite

Le, T., Son, T., Pontelli, E., & Yeoh, W. (2015). Solving Distributed Constraint Optimization Problems Using Logic Programming. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1). https://doi.org/10.1609/aaai.v29i1.9365

Issue

Section

AAAI Technical Track: Heuristic Search and Optimization