Satisfiability: Theory, Practice, and Beyond - sat-rg-restarts reading group
Sprache des Tagungstitel:
Englisch
Original Kurzfassung:
This program will bring together leading theoreticians and practitioners that work on SAT and its generalizations, and approach it from all possible angles: complexity theory, logic, computational algebra, optimization, SAT solving, constraint programming, random instances, SAT modulo theories (SMT), etc. The goal is to develop a better mathematical understanding of real-world efficient computation, and to work towards further algorithmic progress on problems that are currently beyond reach. So far, theoretical and applied research in these areas has developed mostly separately, but several joint workshops in recent years showed that the communities are eager for more interaction. This program is hence an opportunity for a longer-term collaboration and exchange of ideas between theoreticians and practitioners, that has potential for significant long-term impact in mathematics, computer science, and industry. This semester program could provide a decisive contribution in building a joint community of researchers working on constructing efficient algorithms and analyzing the computational complexity of applied problems.
Forschungs-