• Mu (1) is a class of minimal unsatisfiable formulas with the deficiency of the number of clauses and variables to be one.

    是子句数与变元数的差等于1的极小不可满足公式类。

    youdao

  • Based on the relationship, a compounded greedy genetic algorithm and an ant colony algorithm are proposed to derive a minimum unsatisfiable subformula.

    针对最小不可满足子式的求解问题,提出并证明了布尔公式最小不可满足性与极大可满足性之间的关系。

    youdao

  • The paper is concerned with the algorithms for extraction of minimal unsatisfiable (mu) Boolean sub-formula. The algorithms include approximate and exact methods.

    研究了极小布尔不可满足子式的提取算法,它分为近似算法和精确算法两种。

    youdao

  • 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。

    youdao

  • 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型随机算法。

    youdao

  • Unsatisfiable constraints don't have valid solutions.

    不满足的约束没有有效的解决方法。

    youdao

  • Unsatisfiable constraints don't have valid solutions.

    不满足的约束没有有效的解决方法。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定