We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
The paper presents a novel software-pipelining algorithm suitable for optimizing compilers targeting embedded VLIW processors. The proposed algorithm is different from previous ap...
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...