Towards Robust CNF Encodings of Cardinality Constraints
From MaRDI portal
Recommendations
- A parametric approach for smaller and better encodings of cardinality constraints
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Efficient CNF encoding of Boolean cardinality constraints
- Cardinality networks: a theoretical and empirical study
- Cardinality Networks and Their Applications
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5139168 (Why is no real title available?)
- scientific article; zbMATH DE number 2080324 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A linear-time transformation of linear inequalities into conjunctive normal form
- A machine program for theorem-proving
- BerkMin: A fast and robust SAT-solver
- Efficient CNF encoding of Boolean cardinality constraints
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- SATO: An efficient propositional prover
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Cited in
(21)- Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
- Incremental Encoding and Solving of Cardinality Constraints
- A parametric approach for smaller and better encodings of cardinality constraints
- An alternative eager encoding of the all-different constraint over bit-vectors
- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Tight representation of logical constraints as cardinality rules
- Formalizing Dangerous SAT Encodings
- Cardinality Networks and Their Applications
- Efficient CNF encoding of Boolean cardinality constraints
- Approximately propagation complete and conflict propagating constraint encodings
- Circuit Based Encoding of CNF Formula
- Myrvold's results on orthogonal triples of 10 10 Latin squares: a SAT investigation
- CNF encodings of symmetric functions
- Coupling different integer encodings for SAT
- Automatically improving constraint models in Savile Row
- On the implication problem for cardinality constraints and functional dependencies
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- Multi-agent path finding with mutex propagation
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- Cardinality networks: a theoretical and empirical study
This page was built for publication: Towards Robust CNF Encodings of Cardinality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523075)
