The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...