论文信息 - ASP-DPOP: solving distributed constraint optimization problems with logic programming

ASP-DPOP: solving distributed constraint optimization problems with logic programming

Researchers have used Distributed Constraint Optimization Problems (DCOPs) to model various multi-agent coordination and resource allocation problems. However, existing DCOP algorithms have focused almost exclusively on imperative programming techniques. This paper explores a new direction, which is to develop algorithms that use declarative programming, specifically logic programming, techniques.

Enrico Pontelli | Tran Cao Son | William Yeoh | Tiep Le

[1] Makoto Yokoo,et al. Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[2] Boi Faltings,et al. A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[3] Makoto Yokoo,et al. Distributed Problem Solving , 2012, AI Mag..

[4] Enrico Pontelli,et al. Solving Customer-Driven Microgrid Optimization Problems as DCOPs , 2013 .

[5] Martin Gebser,et al. clasp : A Conflict-Driven Answer Set Solver , 2007, LPNMR.

[6] Michael Gelfond,et al. Logic Programs with Classical Negation , 1990, ICLP.

[7] Victor W. Marek,et al. Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[8] Wolfgang Faber,et al. The dlv System: Model Generator and Application Frontends , 1997 .

[9] Ilkka Niemelä,et al. Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.