On Subsumption Removal and On-the-Fly CNF Simplification

@inproceedings{Zhang2005OnSR,
  title={On Subsumption Removal and On-the-Fly CNF Simplification},
  author={Lintao Zhang},
  booktitle={SAT},
  year={2005}
}
Conjunctive Normal Form (CNF) Boolean formulas gen erated from resolution or solution enumeration often have much redundancy. It is desirable to have an efficient algorithm to simplify and comp act such CNF formulas on the fly. Given a clause in a CNF formula, if a subs et of its literals constitutes another clause in the formula, then the first claus e is said to be subsumed by the second clause. A subsumed clause is redundant and c an be removed from the original formula. In this paper, we… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
15 Citations
23 References
Similar Papers

Citations

Publications citing this paper.

References

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

Towards Symmetric Treatme nt of Conflicts And Satisfaction in Quantified Boolean Satisfiability Solver

  • L. Zhang, S. Malik
  • Proc. of 8th International Conference on…
  • 2002
2 Excerpts

Similar Papers

Loading similar papers…