Cardinality Networks and Their Applications

By Roberto Javier Asín Achá, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-carbonell. 2009

80 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Optimal Decision Lists using SAT (2020, background): “2009, Chapter 2) (also see (Ası́n et al. 2009; Bailleux and Boufkhad 2003; Batcher 1968; Sinz 2005)).”
Computing Optimal Decision Sets with SAT (2020, background): “Also note that any of the known cardinality encodings can be used to represent constraint (1) [9, Chapter 2] (also see [1, 5, 7, 53]).”
Core-Boosted Linear Search for Incomplete MaxSAT (2019, background): “Similar constraints are encountered in many different domains, as such a lot of research has been put into developing efficient CNF encodings of them [46, 11, 27].”
Efficient SAT-Based Encodings of Conditional Cardinality Constraints (2018, unknown): “[17, 3, 15, 13, 1, 11]) and pseudo-boolean constraints (e.”
PySAT: A Python Toolkit for Prototyping with SAT Oracles (2018, background): “There are multiple ways to encode cardinality constraints into a set of clauses and most state-of-the-art cardinality encodings are supported by PySAT including pairwise and bitwise encodings [38], sequential counters [48], sorting networks [7], cardinality networks [3], ladder/regular [2, 16], tota”