Automatic frequency assignment for cellular telephones using constraint satisfaction techniques
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Cardinality Networks and Their Applications
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
New Encodings of Pseudo-Boolean Constraints into CNF
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Counting CSP solutions using generalized XOR constraints
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
From approximate to optimal solutions: constructing pruning and propagation rules
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
On SAT modulo theories and optimization problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
This paper introduces new solving strategies for the resolution of Pseudo-Boolean Modularity (PBMod) constraints. In particular, we deal with modular arithmetic constraints on Boolean variables. On the one hand, we analyze translations to Pseudo-Boolean (PB) constraints and apply PB solvers. We also look at those PB solvers that have shown that a transformation to the SAT problem can be an effective solving strategy for PB problems. Among the existing translation techniques we focus on the encoding based on a network of sorters. We extend this encoding technique to generate directly a SAT formula from the PBMod constraints. We compare our approach to other standard techniques such as Satisfiability Modulo Theories (SMT) solvers with support for the Quantifier Free Linear Integer Arithmetic (QF_LIA) theory and the GLPK package for Mixed Integer Programming. In order to conduct our experimental investigation we present a generator of random PBMod constraints and study the impact of the several parameters on the hardness of the instances.