Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Volume 7285 of the series Lecture Notes in Computer Science pp 259-268

Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition

  • Yanyan XuAffiliated withSchool of Information Science and Technology, Beijing Forestry University
  • , Wei ChenAffiliated withNaveen Jindal School of Management, The University of Texas
  • , Kaile SuAffiliated withCollege of Mathematics Physics and Information Engineering, Zhejiang Normal UniversitySchool of Electronics Engineering and Computer Science, Peking University
  • , Wenhui ZhangAffiliated withState Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences

* Final gross prices may vary according to local VAT.

Get Access


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.