3 citations · 7 across the 4 of their papers we have counts for
5 papers · 1 filter
Reusing Comparator Networks in Pseudo-Boolean Encodings
Michał Karpiński, Marek Piotrów
A Pseudo-Boolean (PB) constraint is a linear inequality constraint over Boolean literals. One of the popular, efficient ideas used to solve PB-problems (a set of PB-constraints) is…
Encoding Cardinality Constraints using Generalized Selection Networks
Michał Karpiński, Marek Piotrów
Boolean cardinality constraints state that at most (at least, or exactly) out of propositional literals can be true. We propose a new class of selection networks that can b…
Smaller Selection Networks for Cardinality Constraints Encoding
Michał Karpiński, Marek Piotrów
Selection comparator networks have been studied for many years. Recently, they have been successfully applied to encode cardinality constraints for SAT-solvers. To decrease the siz…
Faster Small-Constant-Periodic Merging Networks
Marek Piotrów
We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using th…
Faster 3-Periodic Merging Networks
Marek Piotrów
We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using th…