Efficient SAT-Based Encodings of Conditional Cardinality Constraints
Work
Year: 2018
Type: article
Abstract: In the encoding of many real-world problems to propositional satisfiability, the cardinality constraint is a recurrent constraint that needs to be managed effectively. Several efficient encodings have... more
Source: EPiC series in computing
Institutions Centre de Recherche en Informatique, Centre National de la Recherche Scientifique, Département d'Informatique
Cites: 16
Cited by: 6
Related to: 10
FWCI: 0.644
Citation percentile (by year/subfield): 73.74
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze