Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1017/S147106841700014X | THEORY AND PRACTICE OF LOGIC PROGRAMMING |
Keywords | Field | DocType |
DCOP,DPOP,logic programming,ASP | Mathematical optimization,Distributed constraint optimization problem,Computer science,Theoretical computer science,Logic programming,Answer set programming | Conference |
Volume | Issue | ISSN |
17 | 4 | 1471-0684 |
Citations | PageRank | References |
1 | 0.35 | 46 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tiep Le | 1 | 20 | 4.98 |
| Tran Cao Son | 2 | 1795 | 169.42 |
| Enrico Pontelli | 3 | 1901 | 181.26 |
| William Yeoh 0001 | 4 | 30 | 4.30 |