Complete SAT solver based on set theory

Authors:
Wensheng Guo;Guowu Yang;Qianqi Le;William N. N. Hung
Affiliations:
University of Electronic Science and Technology, Chengdu, Sichuan, China;University of Electronic Science and Technology, Chengdu, Sichuan, China;University of Electronic Science and Technology, Chengdu, Sichuan, China;Synopsys Inc., Mountain View, California
Venue:
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Year:
2012

Citing 16
Cited 0

FPGA routing and routability estimation via Boolean satisfiability

FPGA '97 Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays
Symbolic model checking using SAT procedures instead of BDDs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Board-level multiterminal net assignment for the partial cross-bar architecture

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on the 2001 international conference on computer design (ICCD)
Segmented channel routability via satisfiability

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Reference model based RTL verification: an integrated approach

HLDVT '04 Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International
Exact phase transitions in random constraint satisfaction problems

Journal of Artificial Intelligence Research
SAT-based Verification for Timed Component Connectors

Electronic Notes in Theoretical Computer Science (ENTCS)
SAT-based analysis of feature models is easy

Proceedings of the 13th International Software Product Line Conference
Making deduction more effective in SAT solvers

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Routability checking for three-dimensional architectures

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An Efficient Resolution Based Algorithm for SAT

TASE '11 Proceedings of the 2011 Fifth International Conference on Theoretical Aspects of Software Engineering
Test pattern generation using Boolean satisfiability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

SAT problem is a NP-complete. Many SAT benchmarks that come from the different real life SAT problems are proposed to verify the performance of solvers. Our research focuses on the Model RB benchmark which can be mapped by the coloring problem and others. We propose a translating method based on set for Model RB instances of CNF formulas, and a complete search algorithm. We use the weight of clauses based on the set to determine the order of the search. The results show our solver has the best runtime for the mostly instances and is comparable to the best SAT solvers.