Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
With reference to an object type defining the two basic operations, read and write, we present solutions to the object sharing problem, classified according to the migration and/o...
We describe a proof dedicated meta-language, called Ltac, in the context of the Coq proof assistant. This new layer of meta-language is quite appropriate to write small and local ...
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...