Satisfiability的例句大全

In this paper we describe a robust and efficient algorithm for ATPG& the algorithm for test pattern generation using satisfiability.

描述一种新的健全高效的测试向量自动生成方法&测试向量生成的可满足性算法。

The definitions of syntax structure, semantic interpretation, knowledge base form and reasoning problems based on satisfiability are given for the extended fuzzy description logic.

定义了扩展模糊描述逻辑的语法结构、语义解释、知识库形式以及基于可满足性的推理问题。

Improving Algorithm for Test Pattern Generation Using Satisfiability

改进可满足性的测试向量生成算法

The Analysis of Algorithms for the Propositional Logic Satisfiability Problem

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

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

最后，根据正交子句组对整个赋值空间的覆盖情况来判断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.

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

the completeness and satisfiability of circumscription under the general structure semantics

一般结构语义下限定的完备性与可满足性

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

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

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

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

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

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

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

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

It is proved that the SEE' satisfiability is solvable in the polynomial time by means of giving a concrete deterministic Turing Machine.

通过给出具体的确定型图林机，证明了SBE的可满足性（SAT）问题在多项式时间内可解。