Optimal Base Encodings for Pseudo-Boolean Constraints
From MaRDI portal
Publication:3000648
DOI10.1007/978-3-642-19835-9_16zbMath1315.68227arXiv1007.4935OpenAlexW2093039789MaRDI QIDQ3000648
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)
Full work available at URL: https://arxiv.org/abs/1007.4935
Related Items (4)
Improving the Normalization of Weight Rules in Answer Set Programs ⋮ Rewriting optimization statements in answer-set programs ⋮ Optimal Base Encodings for Pseudo-Boolean Constraints ⋮ \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logic-based 0-1 constraint programming
- Sum-of-digits function for certain nonstationary bases
- On the number of ordered factorizations of natural numbers
- Optimal Base Encodings for Pseudo-Boolean Constraints
- New Encodings of Pseudo-Boolean Constraints into CNF
This page was built for publication: Optimal Base Encodings for Pseudo-Boolean Constraints