作为证明系统的知识编译语言
Knowledge compilation languages as proof systems
摘要：
在本文中，我们研究证明系统的Cook-Reckhow意义上的问题，是更高的多项式层次比coNP，特别是，#SAT和maxSAT。我们首先解释如何的概念Cook-Reckhow证明系统可以应用到这些问题，并显示如何可以扭曲现有的语言在知识编译，如决策DNNF，使他们可以被视为证明系统的问题，如#SAT和maxSAT。
英文摘要：
In this paper, we study proof systems in the sense of Cook-Reckhow for problems that are higher in the polynomial hierarchy than coNP, in particular, #SAT and maxSAT. We start by explaining how the notion of Cook-Reckhow proof systems can be apply to these problems and show how one can twist existing languages in knowledge compilation such as decision DNNF so that they can be seen as proof systems for problems such as #SAT and maxSAT.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
