是子句数与变元数的差等于1的极小不可满足公式类。
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.
对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。
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.
提出了双目标模型中粒子的电荷和受力的计算公式，引导不可行粒子转化为满足约束条件的粒子；
The computational equations of the charge and force exerted on the particles are presented for the bi-objective model, which will lead the infeasible particles to transform into feasible ones.
针对最小不可满足子式的求解问题，提出并证明了布尔公式最小不可满足性与极大可满足性之间的关系。
Based on the relationship, a compounded greedy genetic algorithm and an ant colony algorithm are proposed to derive a minimum unsatisfiable subformula.
针对最小不可满足子式的求解问题，提出并证明了布尔公式最小不可满足性与极大可满足性之间的关系。
Based on the relationship, a compounded greedy genetic algorithm and an ant colony algorithm are proposed to derive a minimum unsatisfiable subformula.
应用推荐