Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming

Mutsunori Banbara, Martin Gebser, Katsumi Inoue +4

Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We…