Short Proofs for Some Symmetric Quantified Boolean Formulas.

Information Processing Letters（2018）

引用 8|浏览45

暂无评分

摘要

We exploit symmetries to give short proofs for two prominent formula families of QBF proof complexity theory. On the one hand, we employ symmetry breakers. On the other hand, we enrich the (relatively weak) QBF resolution calculus Q-Res with the symmetry rule and obtain separations to powerful QBF calculi.

查看译文

关键词

Automatic theorem proving,Proof complexity,QBF

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要