Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers.
Jan ElffersJesús Giráldez-CruJakob NordströmMarc VinyalsPublished in: SAT (2018)
Keyphrases
- pseudo boolean
- integer linear programming
- combinatorial problems
- propositional satisfiability
- exact solution
- automated reasoning
- pseudo boolean constraints
- symmetry breaking
- constraint programming
- knowledge base
- propositional logic
- sat solvers
- sat encodings
- column generation
- traveling salesman problem
- constraint satisfaction
- constraint satisfaction problems
- knowledge representation
- metaheuristic
- graph coloring
- state space
- lower bound
- phase transition
- branch and bound algorithm
- probabilistic reasoning
- computational properties
- boolean satisfiability
- special case
- discrete optimization problems
- optimal solution