Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points

Eugene Goldberg. Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points. In Andrei Voronkov, editor, Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings. Volume 2392 of Lecture Notes in Computer Science, pages 161-180, Springer, 2002. [doi]

@inproceedings{Goldberg02:0,
  title = {Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points},
  author = {Eugene Goldberg},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2392/23920161.htm},
  tags = {testing},
  researchr = {https://researchr.org/publication/Goldberg02%3A0},
  cites = {0},
  citedby = {0},
  pages = {161-180},
  booktitle = {Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings},
  editor = {Andrei Voronkov},
  volume = {2392},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-43931-5},
}