We implemented the SAT solver from scratch using the Davis Putnam Logemann-Loveland (DPLL) algorithm. The SAT solver can take any file in Clause Normal Form (CNF) with a constraint satisfaction ...
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.
Abstract: Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solvers are based ...
Abstract: SAT (SATisfiability of Propositional Formula) is a well-known NP-Complete problem [1][2]. Conventional solvers for SAT based on traditional DPLL algorithm presents serious CPU-Times ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback