Simplifying pseudo-Boolean constraints in residual number systems

DOI10.1007/978-3-319-09284-3_26MaRDI QIDQ3192081zbMATH OpenOpenAlexFDO

Authors Yoav Fekete, Michael Codish

Publication date 26 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09284-3_26

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Optimal base encodings for pseudo-Boolean constraints
• scientific article; zbMATH DE number 5139168
• A New Look at BDDs for Pseudo-Boolean Constraints
• New Encodings of Pseudo-Boolean Constraints into CNF
• BDDs for pseudo-Boolean constraints -- revisited

Cited in

(3)

• N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
• SAT and IP based algorithms for magic labeling including a complete search for total magic labelings
• Optimal base encodings for pseudo-Boolean constraints

This page was built for publication: Simplifying pseudo-Boolean constraints in residual number systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192081)