unsatisfiable

基本解释

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.
一个公式是极小不可满足的是指该公式本身不可满足;而且从中删去任意一个子句后得到的公式可满足.
Finally, we discuss the current challenges of methods to extract Boolean unsatisfiable subformulae, and outline the future research directions.
最后讨论了布尔不可满足子式的求解方法目前面临的主要挑战，并对今后的研究方向进行了展望。