It means satisfiability problem. You can think of it as one "assembly language" of optimization, in the sense that many higher-order problem formulations can be "compiled" to SAT.

hmm I wonder if the article about SAT solvers defines them? https://codingnest.com/modern-sat-solvers-fast-neat-underuse...

To be fair it took me a bit realize this was part 3 of a series. It would have made more sense to post part 1 to HN.

thanks