On Subsumption Removal and On-the-Fly CNF Simplification

Lintao Zhang. On Subsumption Removal and On-the-Fly CNF Simplification. In Fahiem Bacchus, Toby Walsh, editors, Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings. Volume 3569 of Lecture Notes in Computer Science, pages 482-489, Springer, 2005. [doi]

@inproceedings{Zhang05:8,
  title = {On Subsumption Removal and On-the-Fly CNF Simplification},
  author = {Lintao Zhang},
  year = {2005},
  doi = {10.1007/11499107_42},
  url = {http://dx.doi.org/10.1007/11499107_42},
  researchr = {https://researchr.org/publication/Zhang05%3A8},
  cites = {0},
  citedby = {0},
  pages = {482-489},
  booktitle = {Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings},
  editor = {Fahiem Bacchus and Toby Walsh},
  volume = {3569},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-26276-8},
}