可满足性
The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem. 合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
The satisfiability problem is a key problem in computer science and artificial intelligence. 这是计算机科学和人工智能中的重要问题之一。
The research of this paper is based on the Boolean Satisfiability (SAT) Problem of combinational circuit. 本文研究工作是针对可满足问题（SAT）在组合电路验证和测试中的应用展开的。
Binary decision diagram (BDD) and Boolean sat satisfiability (SAT) are common techniques of logic circuit-based Boolean reasoning scheme. 摘要在基于逻辑电路的布尔推理过程中，经常用到二叉判决图(BDD)与布尔可满足性(SAT)相结合的算法。
Another goal of the project is to find good methods for checking the satisfiability of first-order formulas (in finite domains). 本项目还研究了逻辑公式的可满足性判定问题。
In recent years, the Boolean Satisfiability (SAT) Problem, which is a foundational problem of verification, has made a great advance. 本文分析了现有的电路可满足性验证工具的优缺点，针对验证中学习效率的瓶颈提出了改进的方法，能够更加合理地利用电路现有的信息。
