It was investigated the Boolean satisfiability (SAT) problem defined as follows: given a Boolean formula, check whether an assignment of Boolean values to the propositional variables in the formula exists, such that the formula evaluates to true. If such an assignment exists, the formula is said to be satisfiable; otherwise, it is unsatisfiable. With using of analytical expressions of multi-valued logic 2SAT boolean satisfiability was formulated as linear programming optimization problem. The same linear programming formulation was extended to find 3SAT and kSAT boolean satisfiability for k greater than 3. So, using new analytic multi-valued logic expressions and linear programming formulation of boolean satisfiability proposition that kSAT is in P and could be solved in linear time was proved.
Boolean satisfiability Conjunctive normal form Convex function Linear programming Multi-valued logic NP problem Time complexity.
This is a preview of subscription content, log in to check access.
Krom MR (1967) The decision problem for a class of first-order formulas in which all disjunctions are binary. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 13:15–20MathSciNetCrossRefMATHGoogle Scholar
Levin L (1973) Universal search problems. Probl Inf Trans 9(3), 265–266. (Russian)Google Scholar
Maknickas AA (2010) Finding of k in Fagin’s R. Theorem 24. arXiv:1012.5804v1 (2010).Google Scholar
Maknickas AA (2012) How to solve kSAT in polinomial time. arXiv:1203.6020v1Google Scholar
Maknickas AA (2012) How to solve kSAT in polinomial time. arXiv:1203.6020v2Google Scholar
Maknickas AA (2013) Programming formulation of kSAT. In: Lecture notes in engineering and computer science: Proceedings of the international multiConference of engineers and computer scientists 2013, pp. 1066–1070Google Scholar