SAT problem is the set of satisfiable boolean formulas,which can be widely used in such fields as symbolic logic,artificial intelligence,constraint satisfaction problem,design and detection of VLSI integrate circuit,theories of computer science,computer vision,proof of machine theory,robot program,and machine learning.
SAT问题是指可满足布尔表达式的集合，它在数理逻辑、人工智能、约束可满足性问题、VLSI集成电路设计与检测、计算机科学理论、计算机视觉、机器定理证明、机器人规划、机器学习等领域具有广阔的应用背景。
参考来源 - 线性公式可满足性判定问题的复杂性The replacement parameters, reasoning rules, constraint satisfaction solving and checking parameters were included in the process of whole modification.
事例修改过程包括参数替换、规则推理基于约束满足求解和参数检查这些步骤。
参考来源 - 基于事例推理的车身内部布置系统研究开发·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
In general, constraint satisfaction problems are NP-Complete.
一般而言，约束满足问题是NP完全的。
Constraint propagation is a method for solving constraint satisfaction problem (CSP).
约束传播算法是求解约束满足问题的一种重要方法。
Based on constraint satisfaction problems model a global scheduling module structure is designed.
采用约束满足问题模型建立全局调度系统模型，设计了全局调度模块结构。
应用推荐