Souheib BAARIR (Sorbonne Université – LIP6)
Date: Friday, April 29 2022 – 13h00
Title: Contributions to the analysis of discrete systems through proportional satisfiability
Despite its NP-Completeness, propositional satisfiability
(SAT) covers a broad spectrum of applications. Nowadays, it is an
active research area finding its applications in many contexts:
planning decision, hardware and software verification, cryptology,
computational biology, etc. Hence, the development of approaches that
could handle increasingly challenging SAT problems has become a
focus. In this presentation, I will discuss two directions that
contribute to the improvement of SAT solving: namely, the exploitation
of symmetries and parallelism.
