可满足性问题用英语怎么说,可满足性问题的英文翻译


词语导航

基本信息

词语:可满足性问题

繁体:可滿足性問題

拼音:kě mǎn zú xìng wèn tí

英语翻译

【计】 satisfiability problem; satistiability problem

分词翻译

可满足性的英语翻译:

【计】 satisfiability

问题的英语翻译:

issue; problem; question; trouble
【计】 sieve problem
【经】 subject

翻译例句

1. 可满足性问题(SAT)是当代理论计算机科学的核心问题。

Satisfiability (SAT) problem has been the core problem of research on computational theory.

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

The satisfiability problem of conjunction normal form (abbreviate sat problem) is an NP_complete problem.

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

The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.

4. 约束可满足性问题是一大类常出现于现实应用中的复杂问题,因其繁多的约束条件而出名。Www.WeNtiyI.com

Constraint satisfaction problems are a large category of complex problems in real world applications, noted for various constraints.

5. 该方法以扩展的关系逻辑为语义基础,把一致性问题归结为关系逻辑公式的可满足性问题。

Our approach is based on an extended relational calculus, and reduces the consistency problem to a satisfiability problem of relational formulae.

6. 如果我理解正确,你的问题是,有一个解决的一般算法(即一个满意的分配)利用算法的可满足性问题。

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.

7. 当解释的论域是一个固定大小的有限集合时,一阶逻辑公式的可满足性问题可以等价地归约为SAT 问题。

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.

8. 当解释的论域是一个固定大小的有限集合时,一阶逻辑公式的可满足性问题可以等价地归约为SAT 问题。

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.

版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!