·2,447,543篇论文数据，部分数据来源于NoteExpress
布尔可满足性是计算机科学中最基础的问题之一，已经出现了包括著名的基于查找的SAT算法在内的各种算法。
The Boolean Satisfiability is one of the most fundamental problems in computer science and a variety of algorithms-including the well-known search-based SAT algorithms-have been proposed.
youdao
应用推荐
模块上移
模块下移
不移动