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.
CITATION STYLE
Rabe, M. N. (2017). A resolution-style proof system for DQBF. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10491 LNCS, pp. 314–325). Springer Verlag. https://doi.org/10.1007/978-3-319-66263-3_20
Mendeley helps you to discover research relevant for your work.