Modelling Satisfiability Problems: Theory and Practice / 4012 Valentin Mayer-Eichberger
Boolean Satisfiability (SAT) solvers are a mature technology to solve hard combinatorial problems. The input to a SAT solver is the problem translated to propositional logic in conjunctive normal form (CNF). This thesis studies such translations and aims to make SAT solvers more accessible to non-encoding experts.
Welcome
Future Conferences
AI Journal Division
IJCAI Proceedings
Travel Grant Program
IJCAI Awards