A Proposed SAT Algorithm

Dr. Bagais A.; Abdullahi M.

A Proposed SAT Algorithm

muham08 * §

Contact

Dr. Bagais A.

Contact

Abdullahi M.

Contact

Ahmadu Bello University, Zaria-Nigeria

Article Fingerprint

ReserarchID

CST1IAVT

AI TAKEAWAY

Connecting with the Eternal Ground

Abstract

This paper reviews existing SAT algorithms and proposes a new algorithm that solves the SAT problem. The proposed algorithm differs from existing algorithms in several aspects. First, the proposed algorithm does not do any backtracking during the searching process that usually consumes significant time as it is the case with other algorithms. Secondly, the searching process in the proposed algorithm is simple, easy to implement, and each step is determined instantly unlike other algorithms where decisions are made based on some heuristics or random decisions. For clauses with three literals, the upper bound for the proposed algorithm is O(1.8171 n ). While some researchers reported better upper bounds than this, those upper bounds depend on the nature of the clauses while our upper bound is independent of the nature of the propositional formula.

References

28 Cites in Article

Reference Format

A Barbour (1992). Solutions to the minimization problem of fault-tolerant logic circuits.
R Bruni,A,S (2003). A Complete Adaptive Algorithm for Propositional Satisfiability.
Stephen Cook (1971). The complexity of theorem-proving procedures.
J Crawford,A Baker (1994). Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems.
E Danstin,A Goerdt,E Hirsch,R Kannan,J Kleinberg,C Papadimitriou (2002). A Deterministic (2-2 / k+1)n Algorithm fork-SAT based on Local Search.
Martin Davis,Hilary Putnam (1960). A Computing Procedure for Quantification Theory.
M Davis,H Putnam (1960). A Computing Procedure for Quantification Theory.
Martin Davis,George Logemann,Donald Loveland (1962). A machine program for theorem-proving.
S Devadas (1989). Optimal layout via Boolean satisfiability.
J Freeman (1995). Improvements to Propositional Satisfiability Search Algorithms.
E Hirsch (2000). New Worst Case Upper Bounds for SAT.
E Hirsch (1998). Two New Upper Bounds for SAT.
Mark Doms,Chris Forman (1994). Prices for Local Area Network Equipment.
R Jeroslow,J Wang (1990). Solving Propositional Satisfiability Problems.
H Kauts,B Selman (1992). Planning as Satisfiability.
O Kullmann (1999). New methods for 3-SAT decision and worst-case analysis.
T Larrabee (1992). Test pattern generation using Boolean satisfiability.
C Li,Anbulagan (1997). Heuristics Based on Unit Propagation for Satisfiability Problems.
I Lynce,J Marques-Silva (2002). Hidden structure in unsatisfiable random 3-SAT: an empirical study.
Inês Lynce,João Marques-Silva (2002). The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms.
J Marques-Silva,K Sakallah (1999). IEEE Transactions on Computers. GRASP-A Search Algorithm for Propositional Satisfiability.
B Monien,E Speckenmeyer (1985). Solving satisfiability in less than 2n steps.
M Moskewicz,C Madigan,Y Zhao,L Zhang,S Malik (2001). Chaff: engineering an efficient SAT solver.
D Pretolani (1993). Efficiency and stability of hypergraph SAT algorithms.
K Rosen (1999). Handbook of Discrete and Combinatorial Mathematics.
Ingo Schiermeyer (1993). Solving 3-satisfiability in less than 1, 579n steps.
U Schoning (1999). A probabilistic algorithm for k-SAT and constraint satisfaction problems.
Richard Stallman,Gerald Sussman (1977). Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis.

Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Dr. A., Abdullahi M.. 1969. "A Proposed SAT Algorithm". Global Journal of Computer Science and Technology, Global Journal of Computer Science and Technology - D: Neural & AI GJCST-D Volume 13 (GJCST Volume 13 Issue D1).

More Citation Formats

Select Citation Style:

Download Citation

GJCST Volume 13 Issue D1

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords

complete algorithms complexity NP-complete propositional satisfiability

Classification

GJCST-D Classification F.2.1

Submission ReceivedApril 11, 2013
Peer Review Double Blind
Handling Editor
Accepted May 1, 2013
Published May 15, 2013

Version of record

v1.2

Issue date

January 15, 2013

Language

English

Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D

Article Matrices

Total Score: 148

Country: Nigeria

Subject: Global Journal of Computer Science and Technology

Authors: Dr. Bagais A., Junaidu S. B., Abdullahi M. (PhD/Dr. count: 1)

View Count (all-time): 419

Total Views (Real + Logic): 5196

Total Downloads (simulated): 234

Publish Date: 2013 05, Wed

Monthly Totals (Real + Logic):

Month 1: 58 views
Month 2: 60 views
Month 3: 15 views
Month 4: 50 views
Month 5: 19 views
Month 6: 30 views
Month 7: 22 views
Month 8: 43 views
Month 9: 43 views
Month 10: 54 views
Month 11: 22 views
Month 12: 32 views
Month 13: 33 views
Month 14: 26 views
Month 15: 39 views
Month 16: 40 views
Month 17: 41 views
Month 18: 36 views
Month 19: 31 views
Month 20: 30 views
Month 21: 21 views
Month 22: 20 views
Month 23: 21 views
Month 24: 34 views
Month 25: 28 views
Month 26: 28 views
Month 27: 44 views
Month 28: 36 views
Month 29: 41 views
Month 30: 32 views
Month 31: 43 views
Month 32: 41 views
Month 33: 23 views
Month 34: 25 views
Month 35: 24 views
Month 36: 33 views
Month 37: 32 views
Month 38: 38 views
Month 39: 47 views
Month 40: 38 views
Month 41: 25 views
Month 42: 28 views
Month 43: 30 views
Month 44: 34 views
Month 45: 19 views
Month 46: 36 views
Month 47: 29 views
Month 48: 30 views
Month 49: 30 views
Month 50: 22 views
Month 51: 20 views
Month 52: 23 views
Month 53: 37 views
Month 54: 41 views
Month 55: 29 views
Month 56: 25 views
Month 57: 40 views
Month 58: 20 views
Month 59: 30 views
Month 60: 49 views
Month 61: 31 views
Month 62: 14 views
Month 63: 18 views
Month 64: 36 views
Month 65: 33 views
Month 66: 44 views
Month 67: 31 views
Month 68: 41 views
Month 69: 35 views
Month 70: 44 views
Month 71: 43 views
Month 72: 32 views
Month 73: 36 views
Month 74: 21 views
Month 75: 28 views
Month 76: 19 views
Month 77: 26 views
Month 78: 22 views
Month 79: 35 views
Month 80: 26 views
Month 81: 22 views
Month 82: 45 views
Month 83: 17 views
Month 84: 30 views
Month 85: 32 views
Month 86: 42 views
Month 87: 39 views
Month 88: 22 views
Month 89: 14 views
Month 90: 38 views
Month 91: 26 views
Month 92: 22 views
Month 93: 33 views
Month 94: 39 views
Month 95: 27 views
Month 96: 45 views
Month 97: 27 views
Month 98: 29 views
Month 99: 39 views
Month 100: 18 views
Month 101: 29 views
Month 102: 14 views
Month 103: 31 views
Month 104: 35 views
Month 105: 18 views
Month 106: 40 views
Month 107: 40 views
Month 108: 36 views
Month 109: 31 views
Month 110: 25 views
Month 111: 38 views
Month 112: 27 views
Month 113: 30 views
Month 114: 46 views
Month 115: 45 views
Month 116: 40 views
Month 117: 27 views
Month 118: 25 views
Month 119: 20 views
Month 120: 34 views
Month 121: 26 views
Month 122: 29 views
Month 123: 32 views
Month 124: 26 views
Month 125: 24 views
Month 126: 42 views
Month 127: 49 views
Month 128: 25 views
Month 129: 29 views
Month 130: 27 views
Month 131: 16 views
Month 132: 24 views
Month 133: 38 views
Month 134: 36 views
Month 135: 11 views
Month 136: 35 views
Month 137: 37 views
Month 138: 38 views
Month 139: 30 views
Month 140: 42 views
Month 141: 38 views
Month 142: 43 views
Month 143: 37 views
Month 144: 38 views
Month 145: 32 views
Month 146: 31 views
Month 147: 27 views
Month 148: 44 views
Month 149: 26 views
Month 150: 44 views
Month 151: 39 views
Month 152: 42 views
Month 153: 25 views
Month 154: 42 views
Month 155: 22 views
Month 156: 15 views
Month 157: 42 views
Month 158: 40 views
Month 159: 48 views
Month 160: 43 views

Total Views: 5.2K

Total Downloads: 234

All Trends