A proposed polynomial-time SAT solver concept

I've been working on a polynomial-time SAT solver concept for over a year. This approach doesn't use the resolution rule and directly addresses DPLL's core limitation, where backtracking occurs without retaining state memory. (archived concept) DPLL with Conflict Tree This algorithm is based on decision-only DPLL, with the use of a conflict tree... Weiterlesen: A proposed polynomial-time SAT solver concept