Towards Robust CNF Encodings of Cardinality Constraints
From MaRDI portal
Publication:3523075
DOI10.1007/978-3-540-74970-7_35zbMath1145.68525OpenAlexW2117182791MaRDI QIDQ3523075
Inês Lynce, João P. Marques-Silva
Publication date: 2 September 2008
Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/264200/1/jpms-cp07.pdf
Related Items (10)
Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem ⋮ Automatically improving constraint models in Savile Row ⋮ Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ A Boolean satisfiability approach to the resource-constrained project scheduling problem ⋮ Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability ⋮ Cardinality networks: a theoretical and empirical study ⋮ \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT ⋮ A lower bound on CNF encodings of the at-most-one constraint ⋮ Cardinality Networks and Their Applications ⋮ Multi-agent path finding with mutex propagation
Uses Software
Cites Work
- A linear-time transformation of linear inequalities into conjunctive normal form
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- BerkMin: A fast and robust SAT-solver
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- SATO: An efficient propositional prover
- Theory and Applications of Satisfiability Testing
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Towards Robust CNF Encodings of Cardinality Constraints
