ブラウザの設定でJava Scriptの使用を有効にしてご利用ください。
出典:Wikipedia
出典:『Wikipedia』 (2010/12/09 17:45 UTC 版)
In mathematical logic, given an unsatisfiable boolean propositional formula in conjunctive normal form, a subset of clauses whose conjunction is still unsatisfiable is called an unsatisfiable core of the original formula.
unsatisfiable core