## Modern SAT solvers: fast, neat and underused (part 1.5 of N)

In part 1 of this series, we built a Sudoku solver based on translating Sudoku to SAT and then giving the resulting SAT instance to a SAT solver. We also … »

RSS

In part 1 of this series, we built a Sudoku solver based on translating Sudoku to SAT and then giving the resulting SAT instance to a SAT solver. We also … »

I just got home from the second conference I gave a talk at during September and decided to write about my experiences while I am slowly decompressing. … »

The previous post in this series was a quick introduction to the world of SAT and SAT solvers. In this post, we will convert a harder real-world problem, namely _master-key system_, into SAT and explore some of the more advanced techniques used to efficiently convert problems to SAT. … »

Before I started doing research, I saw SAT solvers as academically interesting but without practical uses ouside of other academic applications. I've since then changed my mind, and I want to change yours, because modern SAT solvers are neat, fast and almost criminally underused by the industry. … »

My previous post about CMake provided a simple CMakeLists.txt for a small, self-contained, project. In practice, very few project are fully self-contained, as they either depend on external libraries, or are themselves libraries that other projects depend on. … »

The end of semester is here and, as I grade our students semestral works, I get to use CMakeLists of dubious quality. After seeing the same errors repeat over and over again, I decided to write a short tutorial towards writing simple CMakeLists. … »

The end of semester is here and, as I grade our students semestral works, I get to use Makefiles of dubious quality. After seeing the same errors repeat over and over again, I decided to write a short tutorial towards writing simple Makefiles. … »

I spent almost a week getting code coverage set up on Travis and AppVeyor and decided to write down what I found out, to make it easier for others. … »