Solving Difficult SAT Instances Using Greedy Clique Decomposition

@inproceedings{Surynek2007SolvingDS,
  title={Solving Difficult SAT Instances Using Greedy Clique Decomposition},
  author={Pavel Surynek},
  booktitle={SARA},
  year={2007}
}
We are dealing with solving difficult SAT instances in this paper. We propose a method for preprocessing SAT instances (CNF formulas) by using consistency techniques known from constraint programming methodology and by using our own consistency technique based on clique decomposition of a graph representing conflicts in the input formula. The clique decomposition allows us to make a strong reasoning over the SAT instance, which even in some cases decides the SAT instance itself without search… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Alexander Nadel's Page

  • A. Nadel
  • Research Web Page. http://www.cs.tau.ac.il/~ale1…
  • 2007
1 Excerpt

Fadi Aloul's Home Page - SAT Benchmarks

  • F. A. Aloul
  • Personal Web Page. http://www.eecs.umich.edu…
  • 2007
3 Excerpts

RSat - ...veRSATile.

  • K. Pipatsrisawat, A. Darwiche
  • Research Web Page. http://reasoning.cs.ucla.edu…
  • 2007
1 Excerpt

SAT Competition 2005

  • D. Le Berre, L. Simon
  • Competition Web Page, http://www.satcompetition…
  • 2007
2 Excerpts

SAT-Race 2006

  • C. Sinz
  • Competition Web Page, http://fmv.jku.at/sat-race…
  • 2007
3 Excerpts

The MiniSat Page

  • N. Eén, N. Sörensson
  • Research Web Page. http://www.cs.chalmers.se/Cs…
  • 2007
2 Excerpts

zChaff

  • Z. Fu, Y. Marhajan, S. Malik
  • Research Web Page. http://www.princeton.edu…
  • 2007
2 Excerpts