Optimal Base Encodings for Pseudo-Boolean Constraints
From MaRDI portal
Publication:3000648
DOI10.1007/978-3-642-19835-9_16zbMATH Open1315.68227arXiv1007.4935OpenAlexW2093039789MaRDI QIDQ3000648FDOQ3000648
Carsten Fuhs, Michael Codish, Yoav Fekete, Peter Schneider-Kamp
Publication date: 19 May 2011
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Abstract: This paper formalizes the optimal base problem, presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT. We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MINISAT+. Experimentation indicates that our algorithm scales to bases involving numbers up to 1,000,000, improving on the restriction in MINISAT+ to prime numbers up to 17. We show that, while for many examples primes up to 17 do suffice, encoding with respect to optimal bases reduces the CNF sizes and improves the subsequent SAT solving time for many examples.
Full work available at URL: https://arxiv.org/abs/1007.4935
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New Encodings of Pseudo-Boolean Constraints into CNF
- On the number of ordered factorizations of natural numbers
- Logic-based 0-1 constraint programming
- Sum-of-digits function for certain nonstationary bases
- Optimal Base Encodings for Pseudo-Boolean Constraints
Cited In (4)
Uses Software
This page was built for publication: Optimal Base Encodings for Pseudo-Boolean Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000648)
