Login
Talks & Seminars
Title: CNF encodings and all that!
Mr. Valentin Mayer-Eichberger, Technische University of Berlin, Germany
Date & Time: October 18, 2019 11:00
Venue: Department of Computer Science and Engineering, Conference Room, 01st Floor, 'C' Block, Kanwal Rekhi (KReSIT) Building
Abstract:
The "SAT solving approach" has been a successful enterprise of theory and application in computer science. In order to solve several interesting NP-Complete problems in practice, one often chooses an encoding using suitably chosen Boolean variables and clauses and runs a SAT solver on it. Such state-of-the-art SAT solvers incorporate decades' long research and highly tweaked implementation techniques. They often work surprisingly well and beat problem specific implementations - despite knowing very little about the actual problem they are solving. However, in practice it is actually not easy to create good SAT encodings and there are lots of tricks and techniques. In this talk, I will present some general results regarding good encoding techniques and present some recent research I've been working on.
Speaker Profile:
Valentin Mayer-Eichberger completed a masters in Computational Logic from University of Dresden and New University of Lisbon in 2008. He's been active in industry both in public transport rostering and computer vision for quality assurance of glass. To advance his understanding of some hard problems in computer science he has been researching SAT encodings for over 8 years. He is currently completing his PhD in this topic at Technische University of Berlin, Germany.
List of Talks

Webmail

Username:
Password:
Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback