JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check

Daniel Singer, Anthony Monnet. JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check. In Roman Wyrzykowski, Jack Dongarra, Konrad Karczewski, Jerzy Wasniewski, editors, Parallel Processing and Applied Mathematics, 7th International Conference, PPAM 2007, Gdansk, Poland, September 9-12, 2007, Revised Selected Papers. Volume 4967 of Lecture Notes in Computer Science, pages 249-258, Springer, 2007. [doi]

@inproceedings{SingerM07,
  title = {JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check},
  author = {Daniel Singer and Anthony Monnet},
  year = {2007},
  doi = {10.1007/978-3-540-68111-3_27},
  url = {http://dx.doi.org/10.1007/978-3-540-68111-3_27},
  tags = {rule-based},
  researchr = {https://researchr.org/publication/SingerM07},
  cites = {0},
  citedby = {0},
  pages = {249-258},
  booktitle = {Parallel Processing and Applied Mathematics, 7th International Conference, PPAM 2007, Gdansk, Poland, September 9-12, 2007, Revised Selected Papers},
  editor = {Roman Wyrzykowski and Jack Dongarra and Konrad Karczewski and Jerzy Wasniewski},
  volume = {4967},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-68105-2},
}