HyperSAT a new generator for 3-SAT instances
Juan Segura-Salazar, José Torres-Jiménez · 2002
Propositional satisfiability is the problem of determining, given a formula of propositional calculus in CNF (Conjunctive Normal Form), if there is an assignment of truth values for the variables in such a way that the whole formula is true. The SAT problem is one of the most important combinatorial optimization problems, in particular the 3-SAT problem is the,first NP-Complete problem. In order to test sat solving algorithms is necessary to generate hard sat instances, in this paper we address the construction and testing of HyperSAT a sat instance generator based on the concept of hypergraphs.