Coupling Different Integer Encodings for SAT
- 10 June 2022
- book chapter
- Published by Springer Nature
- p. 44-63
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- A Parametric Approach for Smaller and Better Encodings of Cardinality ConstraintsLecture Notes in Computer Science, 2013
- A Compact and Efficient SAT-Encoding of Finite Domain CSPLecture Notes in Computer Science, 2011
- Propagation via lazy clause generationConstraints, 2009
- Lazy Clause Generation ReengineeredLecture Notes in Computer Science, 2009
- Compiling finite linear CSP into SATConstraints, 2008
- Universal Booleanization of Constraint Models2008
- MiniZinc: Towards a Standard CP Modelling Language2007
- Finding Large Cliques using SAT Local Search2007
- Finite Domain Bounds Consistency Revisited2006
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints2005