The satisfiabilityproblem of conjunction normal form (abbreviate sat problem) is an NP_complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
2
Our approach is based on an extended relational calculus, and reduces the consistency problem to a satisfiabilityproblem of relational formulae.
该方法以扩展的关系逻辑为语义基础,把一致性问题归结为关系逻辑公式的可满足性问题。
3
When the domain of interpretation is finite and its size is a fixed positive integer, the satisfiabilityproblem in the first-order logic can be reduced to SAT.