BibTeX record conf/sat/PipatsrisawatD09

download as .bib file

@inproceedings{DBLP:conf/sat/PipatsrisawatD09,
  author    = {Knot Pipatsrisawat and
               Adnan Darwiche},
  title     = {Width-Based Restart Policies for Clause-Learning Satisfiability Solvers},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
               International Conference, {SAT} 2009, Swansea, UK, June 30 - July
               3, 2009. Proceedings},
  pages     = {341--355},
  year      = {2009},
  crossref  = {DBLP:conf/sat/2009},
  url       = {https://doi.org/10.1007/978-3-642-02777-2\_32},
  doi       = {10.1007/978-3-642-02777-2\_32},
  timestamp = {Tue, 14 May 2019 10:00:41 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sat/PipatsrisawatD09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sat/2009,
  editor    = {Oliver Kullmann},
  title     = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
               International Conference, {SAT} 2009, Swansea, UK, June 30 - July
               3, 2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5584},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-02777-2},
  doi       = {10.1007/978-3-642-02777-2},
  isbn      = {978-3-642-02776-5},
  timestamp = {Tue, 14 May 2019 10:00:41 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sat/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics