A Review Study of Sat Algorithms: Complete and Incomplete

Exploring the Serial Sat Algorithms and Their Completeness

Authors

  • Devyani Mehul Vasistha Author

Keywords:

SAT algorithms, complete, incomplete, Boolean Satisfiability Problem, translation, Boolean equation, NP-complete, artificial intelligence, algorithm, hardware design

Abstract

In Computer Science, the Boolean Satisfiability Problem (SAT) is the problem of deciding whether there exists a translation that fulfills a given Boolean equation. SAT is one of the principal problems that were demonstrated to be NP-complete, which is additionally central to artificial intelligence, algorithm and hardware design. This paper surveys the primary algorithm called as Serial Sat Algorithms which can complete or incomplete.

Downloads

Download data is not yet available.

Downloads

Published

2019-05-01

Issue

Vol. 16 No. 6 (2019): Journal of Advances and Scholarly Researches in Allied Education (JASRAE)

Section

Articles

How to Cite

[1]
“A Review Study of Sat Algorithms: Complete and Incomplete: Exploring the Serial Sat Algorithms and Their Completeness”, JASRAE, vol. 16, no. 6, pp. 2717–2719, May 2019, Accessed: Apr. 04, 2026. [Online]. Available: https://ignited.in/index.php/jasrae/article/view/11818