A Resolution-Style Proof System for DQBF.

Lecture Notes in Computer Science（2017）

引用 15|浏览104

暂无评分

摘要

This paper presents a sound and complete proof system for Dependency Quantified Boolean Formulas (DQBF) using resolution, universal reduction, and a new proof rule that we call fork extension. This opens new avenues for the development of efficient algorithms for DQBF.

查看译文

关键词

Proof System, Universal Reduction, Fork Extension, Quantiﬁed Boolean Formulas (QBF), Proof Rules

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要