Logic transformation and coding theory-based frameworks for Boolean satisfiability

This paper proposes a new framework to the solution of Boolean Satisfiability. The first approach is based on certain structural analysis using circuit representation. Here, we convert the given CNF into multilevel circuits based on testability-driven transformation and optimization, and then apply a test technique developed by the authors to verify SAT. This test technique is based on the concepts developed by an earlier-proposed verification tool, VERILAT. Certain algebraic coding theory results are then derived that provide a lower bound on the number of solutions to SAT problems. These proposed frameworks have a real potential for providing new theoretical insights.

[1]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[2]  Dhiraj K. Pradhan,et al.  VERILAT: verification using logic augmentation and transformations , 1996, Proceedings of International Conference on Computer Aided Design.

[3]  Dhiraj K. Pradhan,et al.  LOT: Logic Optimization with Testability. New transformations for logic synthesis , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Kwang-Ting Cheng,et al.  A circuit SAT solver with signal correlation guided learning , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[5]  Dhiraj K. Pradhan,et al.  VERILAT: verification using logic augmentation and transformations , 2003, The IEEE International Symposium on Circuits and Systems, 2003. Tutorial Guide: ISCAS 2003..

[6]  Dhiraj K. Pradhan,et al.  Recursive Learning: An attractive alternative to the decision tree for test generation in digital ci , 1992, Proceedings International Test Conference 1992.

[7]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[8]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[9]  Dhiraj K. Pradhan,et al.  LOT: Logic optimization with testability - new transformations using recursive learning , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[10]  D. Pradhan,et al.  VERILAT: verification using logic augmentation and transformations , 2003 .