片语

Stochastic satisfiability随机可满足性

Boolean satisfiability可满足性

concept Satisfiability概念可满足性

satisfiability criteria满意準则

information satisfiability信息可满足性

incremental satisfiability增量可满足性

finite satisfiability有限可满足性

Propositional satisfiabilitySAT求解

satisfiability respresentation可满足性表示

英汉例句

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

• A resolution principle for constrained clauses is proposed, where unification is replaced by testing constraints for satisfiability over the cons...

  本文提出了一种约束子句的消解原理，其中测试是否满足约束理论的约束取代了一致化。

• Description logics systems offer a set of typical inference services, such as concept's classification, satisfiability and realization, knowledge base consistency checking.

  描述逻辑系统可以提供一些典型的推理服务，例如，概念分类，概念的可满足性及概念的实现，知识的一致性检测等一系列的推理服务。

• Finally, the satisfiability of a SAT problem is verified by the covering of orthogonal clause group on the whole assignment space.

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

• The renamings has played a significant role in simplifying resolution proofs of some hard formulas and constructing the efficient satisfiability algorithms.

  改名规则在创建有效的满足性算法和简化某些消解难例的证明中起到了重要作用。

• 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.

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

• Deciding satisfiability of clause set is one of the active research topics in the automated reasoning field.

  子句集的可满足性判定是自动证明领域的热点之一。

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

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

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

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

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

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

• A resolution principle for constrained clauses is proposed, where unification is replaced by testing constraints for satisfiability o...

  本文提出了一种约束子句的消解原理，其中测试是否满足约束理论的约束取代了一致化。

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

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

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

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

• The key reasoning tasks of the semantic Web can be reduced to deciding the satisfiability of formulas.

  语义网的关键推理问题可以化为公式的可满足性判定问题。