Quantifier Elimination in Stochastic Boolean Satisfiability.
Hao-Ren WangKuan-Hua TuJie-Hong Roland JiangChristoph SchollPublished in: SAT (2022)
Keyphrases
- boolean satisfiability
- quantifier elimination
- constraint propagation
- sat solvers
- functional programming
- probabilistic planning
- symmetry breaking
- branch and bound algorithm
- constraint databases
- cardinality constraints
- integer linear programming
- sat problem
- first order logic
- randomly generated
- combinatorial problems
- max sat
- lower bound
- constraint satisfaction problems
- np complete
- general purpose
- computational complexity
- inductive inference
- boolean formula
- linear programming