I'm studying the Moser-Tardos algorithm, which is often used to efficiently find solutions to satisfiability problems and avoid bad events in probabilistic settings. I’ve read that it’s mainly applied in theoretical computer science, particularly for SAT problems, random constraint satisfaction, and graph theory.
Event $A_i$ represents a bad event.
Given its theoretical power, my question is: Are there any known cases where the Moser-Tardos algorithm (or its variants) has been applied to solve real-world, practical problems? For example, has it been used in areas like software engineering, logistics, or industry-specific optimizations?
I understand that the Moser-Tardos algorithm works by resampling entire clauses, whereas many heuristic SAT solvers tend to flip only a single variable. Given this difference, has the Moser-Tardos algorithm been practically applied in any real-world SAT solving scenarios?
I'd love to learn about any examples, papers, or projects that showcase its real-world use. Thanks in advance!