Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
Jakob Puchinger, Peter J. Stuckey, Mark G. Wallace...
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
Despite the significant progress to extend Markov Decision Processes (MDP) to cooperative multi-agent systems, developing approaches that can deal with realistic problems remains ...
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...