Wenlong Liu

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].

Sep 5, 2024 | dx.doi.org | Nannan Zhang |Jiaqi Hu |Wenlong Liu |Wenjun Cai