Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques in- cur the significant overhead of constructing and manipulating graphs during search. We present a set-constraint solver which combines BDD-based set-bounds propagators with the learning abilities of a modern SAT solver. Together with a number of improvements beyond the basic algorithm, this solver is highly competitive with existing propagation based set constraint solvers.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
BERN-NN: Tight Bound Propagation For Neural Networks Using Bernstein Polynomial Interval Arithmetic
In this paper, we present BERN-NN as an efficient tool to perform bound propagation of Neural Networks (NNs). Bound propagation is a critical step in wide range of NN model checkers and reachability analysis tools. Given…
Generic CP-Supported CMSA for Binary Integer Linear Programs
Construct, Merge, Solve and Adapt (CMSA) is a general hybrid metaheuristic for solving combinatorial optimization problems. At each iteration, CMSA (1) constructs feasible solutions to the tackled problem instance in a p…
Combinatorial OptimizationUniform error bounds for quantized dynamical models
This paper provides statistical guarantees on the accuracy of dynamical models learned from dependent data sequences. Specifically, we develop uniform error bounds that apply to quantized models and imperfect optimizatio…
Hybrid Beamforming with Orthogonal delay-Doppler Division Multiplexing Modulation for Terahertz Sensing and Communication
The Terahertz band holds a promise to enable both super-accurate sensing and ultra-fast communication. However, challenges arise that severe Doppler effects call for a waveform with high Doppler robustness while severe p…
ISACBelief Propagation Neural Networks
Learned neural solvers have successfully been used to solve combinatorial optimization and decision problems. More general counting variants of these problems, however, are still largely solved with hand-crafted solvers.…
Combinatorial Optimization