Equivalency reasoning to solve a class of hard SAT problems

@article{Li2000EquivalencyRT,
  title={Equivalency reasoning to solve a class of hard SAT problems},
  author={Chu Min Li},
  journal={Inf. Process. Lett.},
  year={2000},
  volume={76},
  pages={75-81}
}
Consider a propositional formula F in Conjunctive Normal Form (CNF) on a set of Boolean variables {x1, x2, . . . , xn}. Thesatisfiability(SAT) problemconsists in testing whether clauses in F can all be satisfied by some consistent assignment of truth values (1 or 0) to variables. If it is the case, F is saidsatisfiable; otherwise,F is saidunsatisfiable. Let l with or without index be a literal. An equivalency clause of lengthk can be written as l1↔ l2↔ · · ·↔ lk, where operator↔ is commutative… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
10 Citations
11 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 11 references

H

  • J. P. Warners
  • van Maaren, A two phase algorithm for solving a…
  • 1998
Highly Influential
5 Excerpts

An efficient propositional prover

  • H. Zhang
  • in: Proc. Internat. Conf. on Automated Deduction,
  • 1997
Highly Influential
4 Excerpts

Ten challenges in propositional reasoning and search

  • B. Selman, H. Kautz, D. McAllester
  • in: Proc. IJCAI-97,
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…