Satisfiability

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

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

The Analysis of Algorithms for the Propositional Logic Satisfiability Problem

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

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

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

Improving Algorithm for Test Pattern Generation Using Satisfiability

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

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

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

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

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

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

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

Therefore, in the ideological basis, make a list for all variables in this paradigm, then add each clause with variables which it does not originally contain, and make it become k-satisfiability problem that contains n variables.

因此，在上述思想的基础上，先列出该范式中所包含的全部变量，然后在每个子句中加入该子句所没有的变量，使之成为含有n个变量的k-可满足性问题。

A new approach for analytical hierarchy process ( AHP) weight determination, consistency test and improvement was proposed through singular value decomposition ( SVD) and possibility-satisfiability method ( PS).

利用奇异值分解和可能满意度方法，提出了一种新的层次分析法权重计算、一致性检验与改进过程。

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.

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