Unsatisfiable constraints don't have valid solutions.
不满足的约束没有有效的解决方法。
In this latter case, we would say that the function is unsatisfiable; otherwise it is satisfiable.
在这后一种情况下，我们可以说，是不可满足的功能，否则它是满足的。
Mu (1) is a class of minimal unsatisfiable formulas with the deficiency of the number of clauses and.
是子句数与变元数的差等于1的极小不可满足公式类。
Mu (1) is a class of minimal unsatisfiable formulas with the deficiency of the number of clauses and variables to be one.
是子句数与变元数的差等于1的极小不可满足公式类。
Based on above method of counting unsatisfiable solutions, an efficient splitting strategy of theoretical foundation has been proposed.
本文基于前述的对不满足解数估计的方法，提出了一个有理论依据的有效折分策略。
Based on the relationship, a compounded greedy genetic algorithm and an ant colony algorithm are proposed to derive a minimum unsatisfiable subformula.
针对最小不可满足子式的求解问题，提出并证明了布尔公式最小不可满足性与极大可满足性之间的关系。
The paper is concerned with the algorithms for extraction of minimal unsatisfiable (mu) Boolean sub-formula. The algorithms include approximate and exact methods.
研究了极小布尔不可满足子式的提取算法，它分为近似算法和精确算法两种。
For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.
对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。
In this thesis, we present an idea that is to count unsatisfiable solutions by the message of unsatisfiable assignments in searching, and design two efficient Monte Carlo randomized algorithms.
本文提出了一个利用搜索过程中不满足赋值的信息进行不满足解数统计的思想，得到了两个有效的MonteCarlo型随机算法。
In this thesis, we present an idea that is to count unsatisfiable solutions by the message of unsatisfiable assignments in searching, and design two efficient Monte Carlo randomized algorithms.
本文提出了一个利用搜索过程中不满足赋值的信息进行不满足解数统计的思想，得到了两个有效的MonteCarlo型随机算法。
应用推荐