Solving distributed constraint optimization problems using logic programming*†. Issue 4 (27th June 2017)

• Record Type: Journal Article
• Authors: LE, TIEP; SON, TRAN CAO; PONTELLI, ENRICO; YEOH, WILLIAM
• Is Part Of: Theory and practice of logic programming. Volume 17:Issue 4(2017)
• Page Start: 634
• Page End: 683
• Publication Date: 2017-06-27
• Subjects: DCOP, -- DPOP, -- logic programming, -- ASP; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S147106841700014X
• Languages: English
• ISSNs: 1471-0684

Abstract

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.