Optimal length tree-like resolution refutations for 2SAT formulas

K. Subramani. Optimal length tree-like resolution refutations for 2SAT formulas. ACM Trans. Comput. Log., 5(2):316-320, 2004. [doi]

@article{Subramani04:3,
  title = {Optimal length tree-like resolution refutations for 2SAT formulas},
  author = {K. Subramani},
  year = {2004},
  doi = {10.1145/976706.976711},
  url = {http://doi.acm.org/10.1145/976706.976711},
  researchr = {https://researchr.org/publication/Subramani04%3A3},
  cites = {0},
  citedby = {0},
  journal = {ACM Trans. Comput. Log.},
  volume = {5},
  number = {2},
  pages = {316-320},
}