BibTeX record conf/sat/HeuleJB11

download as .bib file

@inproceedings{DBLP:conf/sat/HeuleJB11,
  author       = {Marijn Heule and
                  Matti J{\"{a}}rvisalo and
                  Armin Biere},
  editor       = {Karem A. Sakallah and
                  Laurent Simon},
  title        = {Efficient {CNF} Simplification Based on Binary Implication Graphs},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2011 - 14th
                  International Conference, {SAT} 2011, Ann Arbor, MI, USA, June 19-22,
                  2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6695},
  pages        = {201--215},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-21581-0\_17},
  doi          = {10.1007/978-3-642-21581-0\_17},
  timestamp    = {Mon, 16 Sep 2019 15:30:17 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/HeuleJB11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics