Modelling n-queens problem as conjunctive normal form and solving it with DPLL algorithm. This project should made me familiar with Rust and the test driven approach.

Mastering the DPLL Algorithm: A Cornerstone of SAT Solvers In the realm of artificial intelligence and computational logic, the DPLL (Davis-Putnam-Logemann-Loveland) algorithm stands as a pivotal ...

SAT solvers are increasingly being used to power "automated reasoning" systems. Given the critical nature of some applications of these tools, it seems important to verify the correctness of the SAT ...

For fun, I recently tried "vibe coding" an implementation of DPLL using different LLMs. Each one produced a seemingly correct implementation of DPLL, which seemed to pass some of the basic tests, ...

Define the following logic terms and apply them to real-world problems: Describe the simple model checking algorithm and the theorem proving algorithms - forward chaining and resolution, what they ...