Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism

Calin Anton, Lane Olson. Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism. In Yong Gao, Nathalie Japkowicz, editors, Advances in Artificial Intelligence, 22nd Canadian Conference on Artificial Intelligence, Canadian AI 2009, Kelowna, Canada, May 25-27, 2009, Proceedings. Volume 5549 of Lecture Notes in Computer Science, pages 16-26, Springer, 2009. [doi]

@inproceedings{AntonO09,
  title = {Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism},
  author = {Calin Anton and Lane Olson},
  year = {2009},
  doi = {10.1007/978-3-642-01818-3_5},
  url = {http://dx.doi.org/10.1007/978-3-642-01818-3_5},
  researchr = {https://researchr.org/publication/AntonO09},
  cites = {0},
  citedby = {0},
  pages = {16-26},
  booktitle = {Advances in Artificial Intelligence, 22nd Canadian Conference on Artificial Intelligence, Canadian AI 2009, Kelowna, Canada, May 25-27, 2009, Proceedings},
  editor = {Yong Gao and Nathalie Japkowicz},
  volume = {5549},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-01817-6},
}