Recommendations
- Cardinality networks: a theoretical and empirical study
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Encoding cardinality constraints using multiway merge selection networks
- A parametric approach for smaller and better encodings of cardinality constraints
- Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
Cites work
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Efficient CNF encoding of Boolean cardinality constraints
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Towards Robust CNF Encodings of Cardinality Constraints
Cited in
(26)- Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
- Modeling and solving staff scheduling with partial weighted maxSAT
- Encoding cardinality constraints using multiway merge selection networks
- meSAT: multiple encodings of CSP to SAT
- Sorting networks: to the end and back again
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- Faster merging networks with a small constant period
- \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
- Perfect hashing and CNF encodings of cardinality constraints
- Normalizing cardinality rules using merging and sorting constructions
- Pairwise cardinality networks
- Detecting cardinality constraints in CNF
- Towards Robust CNF Encodings of Cardinality Constraints
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Cardinality of upper average and its application to network optimization
- Curriculum-based course timetabling with SAT and MaxSAT
- Learning Optimal Decision Sets and Lists with SAT
- Resizing cardinality constraints for MaxSAT
- Efficient SAT-based encodings of conditional cardinality constraints
- Cardinality networks: a theoretical and empirical study
- A parametric approach for smaller and better encodings of cardinality constraints
- Efficient CNF encoding of Boolean cardinality constraints
- Small unsatisfiable k-CNFs with bounded literal occurrence
- Towards universally accessible SAT technology
- Exact approaches for the diverse satisfiability problem
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
This page was built for publication: Cardinality Networks and Their Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637166)
