In previous work, it has been shown how to solve atomic broadcast by reduction to consensus on messages. While this solution is theoretically correct, it has its limitations in pr...
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
Josep Argelich, Xavier Domingo, Chu Min Li, Felip ...
Automatic table layout is required in web applications. Unfortunately, this is NP-hard for reasonable layout requirements such as minimizing table height for a given width. One ap...
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
Abstract. Even if the multi-agent paradigm has been evolving for fifteen years, the development of concrete methods for problem solving remains a major challenge. This paper focus...