This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...
Abstract. This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) ...
Despite the importance of the management of inventory in industrial scheduling applications, there has been little research that has addressed reasoning about inventory directly a...