satisfiability problem的例句大全

The satisfiability problem is a key problem in computer science and artificial intelligence.

这是计算机科学和人工智能中的重要问题之一.

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问题。

The Analysis of Algorithms for the Propositional Logic Satisfiability Problem

命题逻辑可满足性问题的算法分析

The satisfiability problem of conjunction normal form ( abbreviate SAT problem ) is an NP _ complete problem.

合取范式可满足性问题 ( 简称SAT问题 ) 是一个NP完全问题.

finally, the satisfiability of a sat problem is verified by the covering of orthogonal clause group on the whole assignment space.

最后，根据正交子句组对整个赋值空间的覆盖情况来判断SAT是否满足。

Two heuristic strategies for solving satisfiability ( SAT ) problem were presented.

提出了两个用于求解可满足性 ( SAT ) 问题的启发式策略.

The research of this paper is based on the Boolean Satisfiability ( SAT ) Problem of combinational circuit.

本文研究工作是针对可满足问题 ( SAT ) 在组合电路验证和测试中的应用展开的.