AN IDEA FOR SOLVING ۳SAT

In this paper, with the use of variable change and the relationships between them, we transform ۰۱ (main) into a solvable state with sequential transformations. Each i (i ۲, ۳, ۴, ۵) binary combination is labeled with new variables. The new variables are +۱ literals (Ni+۱ = N۲). The number of binary combinations in step i is equal to ۴(N). For example, every Oi clause like (x + y + z) with variables like A (x + y), B (x + z), C (y + z), X = x, Y = y, Z = z is converted into (A+B)(A+C)(B+C)(A+Z)(B+Y)(C+X) clauses and these clauses are added to Oi+۱.

کلیدواژه ها:

P versus NP problem ، satisfiability ، Computational Complexity ، SAT ، Boolean Logic