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. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed down over the past few years. On the other hand, w...
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...