Restricted on the proof of unsatisfiability of unsatisfiable formulas, a modified DPLL â€” RSMLS algorithm is presented. The new algorithm has a symmetry rule (Literal renaming ) and three simplified rule ((1,*)-Resolution, Subformula, and Multiple ). As an example, RSMLS algorithm is applied for the proof of unsatisfiability of pigeon-hole formula . We showâ€¦ (More)

2008 The 9th International Conference for Youngâ€¦

2008

k-CNF is the class of CNF formulas in which the length of each clause of every formula is k. The decision problem asks for an assignment of truth values to the variables that satisfies all the clauses of a given CNF formula. k-SAT problem is k-CNF's decision problem. Cook has shown that k-SAT is NP-complete for k ges 3. (k,s)-CNF is the class of CNFâ€¦ (More)