Learning Rate Based Branching Heuristic for SAT Solvers

Jia Hui Liang, Vijay Ganesh, Pascal Poupart, Krzysztof Czarnecki. Learning Rate Based Branching Heuristic for SAT Solvers. In Nadia Creignou, Daniel Le Berre, editors, Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings. Volume 9710 of Lecture Notes in Computer Science, pages 123-140, Springer, 2016. [doi]

@inproceedings{LiangGPC16-0,
  title = {Learning Rate Based Branching Heuristic for SAT Solvers},
  author = {Jia Hui Liang and Vijay Ganesh and Pascal Poupart and Krzysztof Czarnecki},
  year = {2016},
  doi = {10.1007/978-3-319-40970-2_9},
  url = {http://dx.doi.org/10.1007/978-3-319-40970-2_9},
  researchr = {https://researchr.org/publication/LiangGPC16-0},
  cites = {0},
  citedby = {0},
  pages = {123-140},
  booktitle = {Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
  editor = {Nadia Creignou and Daniel Le Berre},
  volume = {9710},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-40969-6},
}