Reformulating Propositional Satisfiability as Constraint Satisfaction

Toby Walsh. Reformulating Propositional Satisfiability as Constraint Satisfaction. In Berthe Y. Choueiry, Toby Walsh, editors, Abstraction, Reformulation, and Approximation, 4th International Symposium, SARA 2000, Horseshoe Bay, Texas, USA, July 26-29, 2000, Proceedings. Volume 1864 of Lecture Notes in Computer Science, pages 233-246, Springer, 2000. [doi]

@inproceedings{Walsh00:1,
  title = {Reformulating Propositional Satisfiability as Constraint Satisfaction},
  author = {Toby Walsh},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1864/18640233.htm},
  tags = {constraints},
  researchr = {https://researchr.org/publication/Walsh00%3A1},
  cites = {0},
  citedby = {0},
  pages = {233-246},
  booktitle = {Abstraction, Reformulation, and Approximation, 4th International Symposium, SARA 2000, Horseshoe Bay, Texas, USA, July 26-29, 2000, Proceedings},
  editor = {Berthe Y. Choueiry and Toby Walsh},
  volume = {1864},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67839-5},
}