The unsatisfiability of random K-SAT formula vs minimal k-hitting set 随机k-SAT公式不可满足性VS最小k-击中集
The semantic validity and entailment problem of XML documents are further provided and they are reduced to the knowledge base unsatisfiability problem in description logic language ΣΗΟΙΝ(?). 此外,还提出了xml文档的语义有效性和xml文档的推理问题,并把它们规约到描述逻辑语言∑ΗΟΙΝ(?)的知识库不可满足性问题。