An Efficient Sequential SAT Solver With Improved Search Strategies

This publication has 9 references indexed in Scilit:

• BerkMin: A fast and robust SAT-solver
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• SAT-based unbounded symbolic model checking
  Published by Association for Computing Machinery (ACM) ,2003
• Symbolic model checking using SAT procedures instead of BDDs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• SATORI-a fast sequential SAT engine for circuits
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Applying SAT Methods in Unbounded Symbolic Model Checking
  Published by Springer Nature ,2002
• Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• IGRAINE-an Implication GRaph-bAsed engINE for fast implication, justification, and propagation
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000
• GRASP: a search algorithm for propositional satisfiability
  IEEE Transactions on Computers, 1999
• A SAT-based implication engine for efficient ATPG, equivalence checking, and optimization of netlists
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1997