Lifting QBF Resolution Calculi to DQBF

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Schmidt, RA et al. (1 more author) (2016) Lifting QBF Resolution Calculi to DQBF. In: Theory and Applications of Satisfiability Testing – SAT 2016 ( Lecture Notes in Computer Science ). 19th International Conference on Theory and Applications of Satisfiability Testing, 05-08 Jul 2016, Bordeaux, France. Springer Verlag , pp. 490-499. ISBN 978-3-319-40969-6

Abstract

We examine the existing resolution systems for quantified Boolean formulas (QBF) and answer the question which of these calculi can be lifted to the more powerful Dependency QBFs (DQBF). An interesting picture emerges: While for QBF we have the strict chain of proof systems Q-Res < IR-calc < IRM-calc, the situation is quite different in DQBF. Q-Res and likewise universal resolution are too weak: they are not complete. IR-calc has the right strength: it is sound and complete. IRM-calc is too strong: it is not sound any more, and the same applies to long-distance resolution. Conceptually, we use the relation of DQBF to EPR and explain our new DQBF calculus based on IR-calc as a subsystem of first-order resolution

Metadata

Authors/Creators:

Beyersdorff, O https://orcid.org/0000-0002-2870-1648
Chew, L
Schmidt, RA
Suda, M

© Springer International Publishing Switzerland 2016. This is an author produced version of a conference paper published in Lecture Notes in Computer Science. Uploaded in accordance with the publisher's self-archiving policy. The final publication is available at Springer via https://dx.doi.org/10.1007/978-3-319-40970-2_30.

Dates: