# Traveling Salesman SAT Solver ## Introduction This project offers a unique solution to the Traveling Salesman Problem (TSP) by converting it into a SAT (Boolean Satisfiability Problem) and solving ...
The repository showcases a recursive backtracking-based search algorithm, inspired by Davis–Putnam–Logemann–Loveland (DPLL) algorithm. The algorithm decides the satisfiability of propositional logic ...
Abstract: Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback