RTL hybrid satisfiability solving is the key technique of RTL verification.
RTL混合可满足性求解是RTL验证中的关键技术。
Two heuristic strategies for solving satisfiability (sat) problem were presented.
提出了两个用于求解可满足性(SAT)问题的启发式策略。
The traditional idea used in TP is to try to deduce the empty clause to check satisfiability.
定理证明中通常的想法是通过推出空子句的方法来判定子句集的可满足性。
The key reasoning tasks of the semantic Web can be reduced to deciding the satisfiability of formulas.
语义网的关键推理问题可以化为公式的可满足性判定问题。
Deciding satisfiability of clause set is one of the active research topics in the automated reasoning field.
子句集的可满足性判定是自动证明领域的热点之一。
Owing to the shortcoming of existing methods, we put forward a new algorithm based on possibility-satisfiability degree.
针对这一现状，提出了基于可能满意度的残缺矩阵相容性修正及排序新算法。
Finally, the satisfiability of a SAT problem is verified by the covering of orthogonal clause group on the whole assignment space.
最后，根据正交子句组对整个赋值空间的覆盖情况来判断SAT是否满足。
Our approach is based on an extended relational calculus, and reduces the consistency problem to a satisfiability problem of relational formulae.
该方法以扩展的关系逻辑为语义基础，把一致性问题归结为关系逻辑公式的可满足性问题。
The paper proposes controlling input values tracing algorithm and test derivation algorithm based on test pattern generation using satisfiability.
以组合电路的满足性测试生成算法为基础，提出了控制输入跟踪算法和测试衍生算法。
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 问题。
Description logics systems offer a set of typical inference services, such as concept's classification, satisfiability and realization, knowledge base consistency checking.
描述逻辑系统可以提供一些典型的推理服务，例如，概念分类，概念的可满足性及概念的实现，知识的一致性检测等一系列的推理服务。
The definitions of syntax structure, semantic interpretation, knowledge base form and reasoning problems based on satisfiability are given for the extended fuzzy description logic.
定义了扩展模糊描述逻辑的语法结构、语义解释、知识库形式以及基于可满足性的推理问题。
Owing to the shortcomings of existing methods, we applied the concept of "possibility-satisfiability degree" into this realm, and put forward a new kind of optimal adjustment algorithm.
针对现有检验与调整方法存在的不足，将“可能满意度”的概念引入该领域，提出一种新的优化调整算法。
The Boolean Satisfiability is one of the most fundamental problems in computer science and a variety of algorithms-including the well-known search-based SAT algorithms-have been proposed.
布尔可满足性是计算机科学中最基础的问题之一，已经出现了包括著名的基于查找的SAT算法在内的各种算法。
The Boolean Satisfiability is one of the most fundamental problems in computer science and a variety of algorithms-including the well-known search-based SAT algorithms-have been proposed.
布尔可满足性是计算机科学中最基础的问题之一，已经出现了包括著名的基于查找的SAT算法在内的各种算法。
应用推荐