Solving difficult SAT problems by using OBDDs and greedy clique decomposition

Authors:
Yanyan Xu;Wei Chen;Kaile Su;Wenhui Zhang
Affiliations:
School of Information Science and Technology, Beijing Forestry University, China;Naveen Jindal School of Management, The University of Texas, Dallas;College of Mathematics Physics and Information Engineering, Zhejiang Normal University, Jinhua, China,School of Electronics Engineering and Computer Science, Peking University, China;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China
Venue:
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Year:
2012

Citing 20
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Solving difficult SAT instances in the presence of symmetry

Proceedings of the 39th annual Design Automation Conference
Symbolic Model Checking

Symbolic Model Checking
Resolution versus Search: Two Strategies for SAT

Journal of Automated Reasoning
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

Journal of Symbolic Computation
Checking satisfiability of a conjunction of BDDs

Proceedings of the 40th annual Design Automation Conference
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Resolution and binary decision diagrams cannot simulate each other polynomially

Discrete Applied Mathematics - The renesse issue on satisfiability
Symbolic Techniques in Satisfiability Solving

Journal of Automated Reasoning
A direct construction of polynomial-size OBDD proof of pigeon hole problem

Information Processing Letters
The BDD-Based Dynamic A* Algorithm for Real-Time Replanning

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A Generalized Framework for BDD-based Replanning A* Search

SNPD '09 Proceedings of the 2009 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing
Solving difficult SAT instances using greedy clique decomposition

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Extended resolution proofs for conjoining BDDs

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Search vs. symbolic techniques in satisfiability solving

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Extended resolution proofs for symbolic SAT solving with quantification

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
BDDRPA*: an efficient BDD-Based incremental heuristic search algorithm for replanning

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
A new FPGA detailed routing approach via search-based Boolean satisfiability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

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.