Wenjing Chang

Jan 22, 2025 | mdpi.com | Wenjing Chang |Wenlong Liu

1. IntroductionThe Boolean satisfiability problem (SAT), often referred to as the propositional satisfiability problem, represents a fundamental challenge in computer science. This problem involves determining whether there exists an assignment of truth values to the variables of a Boolean formula that makes the formula evaluate to true. If such an assignment exists, the formula is classified as satisfiable (SAT); otherwise, it is labeled as unsatisfiable (UNSAT) [1].

Nov 28, 2024 | mdpi.com | Yanlin Ma |Wenjing Yu |Wenjing Chang |Yayu Wang

All articles published by MDPI are made immediately available worldwide under an open access license. No special permission is required to reuse all or part of the article published by MDPI, including figures and tables. For articles published under an open access Creative Common CC BY license, any part of the article may be reused without permission provided that the original article is clearly cited. For more information, please refer to https://www.mdpi.com/openaccess.

Aug 8, 2024 | peerj.com | Wenjing Chang |Mengyu Guo |Henan Polytechnic |Junwei Luo

The Boolean satisfiability (SAT) problem is a classic problem in mathematical logic, which involves determining whether there exists at least one assignment to the variables such that the given formula evaluates to true. If such an assignment exists, the SAT problem is satisfiable; otherwise, it is unsatisfiable.