Things done under this project
- Read and understood (tried to) a paper by Michael Rabin and Dana Scott (in 1959) on Finite Automata and their Decision Problems
- Understood related concepts such as satisfiability, CNF, DPLL algorithm and Conflict Driven Clause Learning
- Finally, coded up DPLL and CDCL based SAT solvers to handle 2-CNF formulae