Recommendations
Cites work
- A comparison between SAT and CSP techniques
- Decomposing Global Grammar Constraints
- Efficient CNF encoding of Boolean cardinality constraints
- scientific article; zbMATH DE number 2080324 (Why is no real title available?)
- Principles and Practice of Constraint Programming – CP 2004
- Propagation in CSP and SAT
- Revisiting the Sequence Constraint
- Theory and Applications of Satisfiability Testing
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Cited in
(13)- The power of propagation: when GAC is enough
- Propagation complete encodings of smooth DNNF theories
- Computing AES related-key differential characteristics with constraint programming
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Computational protein design as an optimization problem
- Set constraint model and automated encoding into SAT: application to the social golfer problem
- Synthesis of domain specific CNF encoders for bit-vector solvers
- Knowledge compilation with empowerment
- New Encodings of Pseudo-Boolean Constraints into CNF
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework
- scientific article; zbMATH DE number 2084741 (Why is no real title available?)
- Bounds on the size of PC and URC formulas
- Automated Reasoning with Analytic Tableaux and Related Methods
This page was built for publication: GAC Via Unit Propagation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523055)