The satisfiability problem of conjunction normal form (abbreviate sat problem) is an NP_complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
Our approach is based on an extended relational calculus, and reduces the consistency problem to a satisfiability problem of relational formulae.
该方法以扩展的关系逻辑为语义基础，把一致性问题归结为关系逻辑公式的可满足性问题。
When the domain of interpretation is finite and its size is a fixed positive integer, the satisfiability problem in the first-order logic can be reduced to SAT.
当解释的论域是一个固定大小的有限集合时，一阶逻辑公式的可满足性问题可以等价地归约为SAT 问题。
Assuming I understand your question correctly, yes, there is a general algorithm to find a solution (i. e. a satisfying assignment) by using the algorithm for the satisfiability problem.
如果我理解正确，你的问题是，有一个解决的一般算法(即一个满意的分配)利用算法的可满足性问题。
To emphasize the binary nature of this problem, it is frequently referred to as Boolean or propositional satisfiability.
强调二进制的性质这一问题，这是经常被称为布尔或命题满足。
Two heuristic strategies for solving satisfiability (sat) problem were presented.
提出了两个用于求解可满足性(SAT)问题的启发式策略。
Satisfiability (SAT) problem has been the core problem of research on computational theory.
可满足性问题(SAT)是当代理论计算机科学的核心问题。
Finally, the satisfiability of a SAT problem is verified by the covering of orthogonal clause group on the whole assignment space.
最后，根据正交子句组对整个赋值空间的覆盖情况来判断SAT是否满足。
The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
应用推荐