Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning

Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen. Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning. Logical Methods in Computer Science, 4(4), 2008. [doi]

@article{BussHJ08,
  title = {Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning},
  author = {Samuel R. Buss and Jan Hoffmann 0002 and Jan Johannsen},
  year = {2008},
  doi = {10.2168/LMCS-4(4:13)2008},
  url = {http://dx.doi.org/10.2168/LMCS-4(4:13)2008},
  tags = {refinement},
  researchr = {https://researchr.org/publication/BussHJ08},
  cites = {0},
  citedby = {0},
  journal = {Logical Methods in Computer Science},
  volume = {4},
  number = {4},
}