satisfiability problem

The Analysis of Algorithms for the Propositional Logic Satisfiability Problem

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

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 ) 问题的启发式策略.

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

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

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-可满足性问题。

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

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