SAT Instances Construction Based on Hypergraphs

The SAT problem is one of the most important combinatorial optimization problems, it consists of determining given a formula of propositional calculus in CNF (Conjunctive Normal Form) if exists an assignment of truth values for the variables, that makes the whole formula true. The 3-SAT problem is the first NP-complete problem. This paper describes a representation of SAT instances based on hypergraphs and introducing the Signed K-Dimensional Labeled Multi-Hypergraph (SKDLMH) concept.