Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints

DOI10.1007/s10601-023-09364-1arXiv2307.09342OpenAlexW4388231323MaRDI QIDQ6154177

James Alfred Walker, Peter W. Nightingale, Felix Ulrich-Oltean

Publication date: 14 February 2024

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.09342

zbMATH Keywords

linear constraintsmachine learningconstraint programmingglobal constraintsSAT encodingspseudo-Boolean constraints

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Compiling finite linear CSP into SAT
• Automatically improving constraint models in Savile Row
• \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
• SAT competition 2020
• SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
• SAT encodings of pseudo-Boolean constraints with at-most-one relations
• meSAT: multiple encodings of CSP to SAT
• A New Look at BDDs for Pseudo-Boolean Constraints
• New Encodings of Pseudo-Boolean Constraints into CNF
• Random forests