Supplemental material for the paper "On Division Versus Saturation in Pseudo-Boolean Solving", including benchmarks, solver source code and experimental data
Very often, problems modeled using pseudo-Boolean constraints are optimization problems, not satisfa...
AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean...
International audienceLearning pseudo-Boolean (PB) constraints in PB solvers using the cutting plane...
peer reviewedThis article briefly surveys some fundamental results regarding pseudo-Boolean function...
A pseudo-boolean constraint (PB-constraint) is a linear in-equality with 0-1 variables and integer c...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ar...
Abstract—We revisit pseudo-Boolean Solving via compilation to SAT. We provide an algorithm for solvi...
We describe two methods of doing inference during search for a pseudo-Boolean version of the RELSAT ...
Most modern SAT solvers are based on resolution and CNF representation. The performance of these has...
Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, a...
Current implementations of pseudo-Boolean (PB) solvers working on native PB constraints are based on...
A pseudo-Boolean function is a function from a 0/1-vector to the reals. Minimizing pseudo-Boolean fu...
The last 20 years have seen dramatic improvements in the performance of algorithms for Boolean satis...
International audienceCurrent pseudo-Boolean solvers implement different variants of the cutting pla...
Pseudo-Boolean solvers that generalize the CDCL algorithm and reason within the cutting planes proof...
Very often, problems modeled using pseudo-Boolean constraints are optimization problems, not satisfa...
AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean...
International audienceLearning pseudo-Boolean (PB) constraints in PB solvers using the cutting plane...
peer reviewedThis article briefly surveys some fundamental results regarding pseudo-Boolean function...
A pseudo-boolean constraint (PB-constraint) is a linear in-equality with 0-1 variables and integer c...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ar...
Abstract—We revisit pseudo-Boolean Solving via compilation to SAT. We provide an algorithm for solvi...
We describe two methods of doing inference during search for a pseudo-Boolean version of the RELSAT ...
Most modern SAT solvers are based on resolution and CNF representation. The performance of these has...
Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, a...
Current implementations of pseudo-Boolean (PB) solvers working on native PB constraints are based on...
A pseudo-Boolean function is a function from a 0/1-vector to the reals. Minimizing pseudo-Boolean fu...
The last 20 years have seen dramatic improvements in the performance of algorithms for Boolean satis...
International audienceCurrent pseudo-Boolean solvers implement different variants of the cutting pla...
Pseudo-Boolean solvers that generalize the CDCL algorithm and reason within the cutting planes proof...
Very often, problems modeled using pseudo-Boolean constraints are optimization problems, not satisfa...
AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean...
International audienceLearning pseudo-Boolean (PB) constraints in PB solvers using the cutting plane...
DOI
Add to ORKG