论文部分内容阅读
The minimal unsatisfiability problem is considered of the propositional formulas in CNF which in the case of variables x<sub>1</sub>,…, x<sub>n</sub> consist of n+k clauses including <sub>x<sub>1</sub></sub>