您要查找的是不是：
- minimal unsatisfiable subformula 极小不可满足子公式
- minimum unsatisfiable subformula 最小不可满足子式
- Finally, we discuss the current challenges of methods to extract Boolean unsatisfiable subformulae, and outline the future research directions. 最后讨论了布尔不可满足子式的求解方法目前面临的主要挑战，并对今后的研究方向进行了展望。
- unsatisfiable subformula 不可满足子式
- The new algorithm has a symmetry rule（Literal renaming） and three simplifing rules（（1，*）-Resolution，Subformula，and Multiple）. 新的算法带有一条对称规则（文字改名规则）和三条简化规则（（1，*）-消解、子公式、重复规则）。
- The principle and method for transforming CNF to (r,s)-CNF and constructing unsatisfiable formulas in (r,s)-CNF are presented. 并且;给出了CNF到(r;s)-CNF公式转换以及(r;s)-CNF中不可满足公式构造的原理和方法.
- A CNF formula F is minimal unsatisfiable (MU) if F is unsatisfiable and deleting an arbitrary clause results a satisfiable formula. 一个CNF公式F称为极小不可满足的(MU)，如果F是不可满足，并且在F中删去任意一个子句后所得到的公式是可满足的。
- A CNF formula F is minimal unsatisfiable if F is unsatisfiable and the resulting formula deleting anyone clause from F is satisfiable. 一个公式是极小不可满足的是指公式不可满足而且从中删去任一个子句后得到的公式可满足。
- A CNF formula F is minimally unsatisfiable if F is unsatisfiable and the resulting formula deleting any one clause from F is satisfiable. 一个公式是极小不可满足的是指该公式本身不可满足;而且从中删去任意一个子句后得到的公式可满足.
- We proved that in the case where each constraint is easy to satisfy, Model GB exhibits non-trivial behavior (not trivially satisfiable or unsatisfiable). 本文证明了当模型GB的约束容易满足时，该模型表现出非平凡的渐进行为（既不是平凡有解的也不是平凡无解的）。
- The paper is concerned with the algorithms for extraction of minimal unsatisfiable (MU) Boolean sub-formula.The algorithms include approximate and exact methods. 摘要研究了极小布尔不可满足子式的提取算法，它分为近似算法和精确算法两种。
- One can only estimate some bounds of f(r) except for f(3)=3 and f(4)=4. In this paper, the applications of minimal unsatisfiable formulas are described for transformations between CNF formulas. 函数f是否可计算是一个开问题;除了知道f(3)=3;f(4)=4外;只能估计f(r)的界.;描述了极小不可满足公式在CNF公式类之间转换中的作用
- Complete Proof Systems for Unsatisfiable Formulas 不可满足公式的完备证明系统
- Algorithms for Extracting Minimal Unsatisfiable Boolean Sub-formula 极小布尔不可满足子式的提取算法
- Equivalence Structure of a Subclass of Minimal Unsatisfiable Formulas 一个极小不可满足公式子类的等价结构
- Keywords Bonding subformula;Efficient charge of valent electron;Crystal field splitting; 键子式;有效价电子电荷;晶场劈裂;
- Applications of Minimal Unsatisfiable Formulas to Polynomially Reduction for Formulas 极小不可满足公式在多项式归约中的应用
- maximal satisfiable subformula 极大可满足子式
- subformula 子公式
- 6.A CNF formula F is minimal unsatisfiable if F is unsatisfiable and the resulting formula deleting anyone clause from F is satisfiable. 一个公式是极小不可满足的是指公式不可满足而且从中删去任一个子句后得到的公式可满足。
