ML Anthology

Solving Distributed Constraint Optimization Problems Using Logic Programming

Tiep Le, Tran Cao Son, Enrico Pontelli, William Yeoh
AAAI 2015 pp. 1174-1181
doi:10.1609/AAAI.V29I1.9365 /aaai/2015/le2015aaai-solving/

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.

PDF AAAI Semantic Scholar

Cite

Text

Le et al. "Solving Distributed Constraint Optimization Problems Using Logic Programming." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9365

Markdown

[Le et al. "Solving Distributed Constraint Optimization Problems Using Logic Programming." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/le2015aaai-solving/) doi:10.1609/AAAI.V29I1.9365

BibTeX

@inproceedings{le2015aaai-solving,
  title     = {{Solving Distributed Constraint Optimization Problems Using Logic Programming}},
  author    = {Le, Tiep and Son, Tran Cao and Pontelli, Enrico and Yeoh, William},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {1174-1181},
  doi       = {10.1609/AAAI.V29I1.9365},
  url       = {https://mlanthology.org/aaai/2015/le2015aaai-solving/}
}