A Hybrid Approach to Solve SAT and UNSAT Problems

This work involves the construction of a hybrid approach to solve SAT and UNSAT problems. The solution combines techniques found in Stalmarck and DPLL algorithms for solving propositional satisfiability problems. We extend the Stalmarck rules in order to reduce computational cost during the deduction phase. We applied our solution to SAT and UNSAT instances. From the results it was found that this approach showed good results for UNSAT industrial instances. In some cases, our approach obtained gains of 45% to 60% in terms of efficient when compared to existing approaches. We compared our solution against the best known SAT solvers such as ZChaff and RSat. The techniques and methods involved are described in the article.

[1]  Mikolás Janota,et al.  Digital Object Identifier (DOI): , 2000 .

[2]  Jakob Nordström.  Stalmarck's Method versus Resolution: A Comparative Theoretical Study , 2001 .

[3]  G. Takeuti.  Proof Theory , 1975 .

[4]  Ghita Holmström-Hintikka,et al.  Provability in Logic , 2001 .

[5]  Gunnar Stålmarck.  A Note on the Computational Complexity of the Pure Classical Implication Calculus , 1989, Inf. Process. Lett..

[6]  Marcello D'Agostino,et al.  Investigations into the complexity of some propositional calculi , 1990 .

[7]  Evert W. Beth,et al.  Semantic Entailment And Formal Derivability , 1955 .

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

[9]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

[10]  Danilo Medeiros Eler,et al.  Blank Spots Identification on Plantations , 2018, IEEE Latin America Transactions.

[11]  Joao Marques-Silva,et al.  Combinational equivalence checking using satisfiability and recursive learning , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[12]  Inês Lynce,et al.  SAT in Bioinformatics: Making the Case with Haplotype Inference , 2006, SAT.

[13]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[14]  R. L. Goodstein,et al.  Provability in logic , 1959 .

[15]  Mary Sheeran,et al.  A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic , 1998, FMCAD.

[16]  J. Bustos,et al.  Formal verification of distributed system using an executable C model , 2016, IEEE Latin America Transactions.

[17]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[18]  Randal E. Bryant,et al.  Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors , 2003, J. Symb. Comput..

[19]  J. Avigad.  Proof Theory , 2017, 1711.01994.

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

[21]  Peter A. Flach.  First-Order Logic , 2018, Encyclopedia of Machine Learning.

[22]  Mary Sheeran,et al.  A Tutorial on Stålmarck's Proof Procedure for Propositional Logic , 2000, Formal Methods Syst. Des..

[23]  Fabio Massacci,et al.  Logical Cryptanalysis as a SAT Problem ? Encoding and Analysis of the U.S. Data Encryption Standard , 2000 .