Constraint satisfaction through GBP-guided deliberate bit flipping

DOI10.1007/978-3-030-21363-3_3MaRDI QIDQ2175406zbMATHOpenAlexFDO

Authors Mohsen Bahrami, Bane Vasić

Publication date 29 April 2020

Full work available at URL http://hdl.handle.net/10150/634958

zbMATH Keywords

graphical modelsprobabilistic inferencegeneralized belief propagation

Mathematics Subject Classification ID

Bayesian inference (62F15) Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• A bit-encoding phase selection strategy for satisfiability solvers
• Sharpening constraint programming approaches for bit-vector theory
• scientific article; zbMATH DE number 2243409
• On solving quantified bit-vector constraints using invertibility conditions
• Towards satisfiability modulo parametric bit-vectors
• An alternative to SAT-based approaches for bit-vectors
• Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
• scientific article; zbMATH DE number 1975617

This page was built for publication: Constraint satisfaction through GBP-guided deliberate bit flipping

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