Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition
- Cite this paper as:
- Xu Y., Chen W., Su K., Zhang W. (2012) Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition. In: Snoeyink J., Lu P., Su K., Wang L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg
In this paper, we propose an OBDD-based algorithm called greedy clique decomposition, which is a new variable grouping heuristic method, to solve difficult SAT problems. We implement our algorithm and compare it with several state-of-art SAT solvers including Minisat, Ebddres and TTS. We show that with this new heuristic method, our implementation of an OBDD-based satisfiability solver can perform better for selected difficult SAT problems, whose conflict graphs possess a clique-like structure.
Unable to display preview. Download preview PDF.