The seminar is a journey through advanced methods of parallelization and diversification in modern solvers for the propositional Satisfiability problem (SAT). Starting at the wells of "ManySAT", we travel the roads of "Painless" to the origins of "HordeSat". We will understand the essence of "Cube-and-Conquer" and its most prominent application . Finally, in the valley of statistical significance, we will learn about the power of "SATzilla" and admire the beauty of "SNNAP".
Welcome! Here is some initial information for this year's seminar about advanced SAT solving.
- We anticipate the course to take place online and without any in-person meetings.
- We encourage presentations to be held in English (as that is also the language of the papers we discuss).
- The first meeting wil take place Thursday, November 5, 2020 at 14:00 where we will discuss the assignment of topics and the further meetings. Join us at kit-lecture(dot)zoom(dot)us(slash)j(slash)8820981118?pwd=V3d6S0ZVeGlKM3lLMGEzZkh4SXRuUT09 with a six-character password corresponding to the winner of the main track of this year's SAT Competition (in small letters).
- If you are interested in participating, you can just join us at the first meeting – preferably after having sent us a short mail saying that you intend to participate.