Three is a crowd: SAT, SMT and CLP on a chessboard

Constraint solving technology for declarative formal models has made considerable progress in recent years, and has many applications such as animation of high-level specifications, test case generation, or symbolic model checking.

January 2018 · Sebastian Krings, Michael Leuschel, Philipp Körner, Stefan Hallerstede, Miran Hasanagic · In Proceedings PADL 2018, Springer LNCS