Simplifying Pseudo Boolean Problems
From International Center for Computational Logic
Simplifying Pseudo Boolean Problems
Topic no longer available
- Supervisor Norbert Manthey
- Start
Modern pseudo Boolean solvers do not use simplification techniques, but in SAT solvers these techniques are heavily used. In this project different simplification approaches similarly to the SAT techniques should be implemented and evaluated in combination with state-of-the-art PB solvers.
