Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition

  • Yanyan Xu
  • Wei Chen
  • Kaile Su
  • Wenhui Zhang
Conference paper

DOI: 10.1007/978-3-642-29700-7_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7285)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yanyan Xu
    • 1
  • Wei Chen
    • 2
  • Kaile Su
    • 3
    • 4
  • Wenhui Zhang
    • 5
  1. 1.School of Information Science and TechnologyBeijing Forestry UniversityChina
  2. 2.Naveen Jindal School of ManagementThe University of TexasDallasUSA
  3. 3.College of Mathematics Physics and Information EngineeringZhejiang Normal UniversityJinhuaChina
  4. 4.School of Electronics Engineering and Computer SciencePeking UniversityChina
  5. 5.State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of SciencesChina

Personalised recommendations