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。
Mu (1) is a class of minimal unsatisfiable formulas with the deficiency of the number of clauses and variables to be one.
是子句数与变元数的差等于1的极小不可满足公式类。
The paper is concerned with the algorithms for extraction of minimal unsatisfiable (mu) Boolean sub-formula. The algorithms include approximate and exact methods.
研究了极小布尔不可满足子式的提取算法,它分为近似算法和精确算法两种。