Classes of Hard Formulas for QBF Resolution
نویسندگان
چکیده
To date, we know only a few handcrafted quantified Boolean formulas (QBFs) that are hard for central QBF resolution systems such as Q-Res and QU-Res, one specific family to separate QU-Res. Here provide general method construct The construction uses simple propositional (e.g. minimally unsatisfiable formulas) in combination with easy gadgets (Σb2 without constant winning strategies). This leads host of new formulas, including classes random QBFs. We further present generic constructions separating LD-Q-Res.
منابع مشابه
The Riis Complexity Gap for QBF Resolution
We give an analogue of the Riis Complexity Gap Theorem for Quantified Boolean Formulas (QBFs). Every first-order sentence φ without finite models gives rise to a sequence of QBFs whose minimal refutations in tree-like QResolution are either of polynomial size (if φ has no models) or at least exponential in size (if φ has some infinite model). However, differently from the translations to propos...
متن کاملqbf2epr: A Tool for Generating EPR Formulas from QBF
We present the tool qbf2epr which translates quantified Boolean formulas (QBF) to formulas in effectively propositional logic (EPR). The decision problem of QBF is the prototypical problem for PSPACE, whereas EPR is NEXPTIME-complete. Thus QBF is embedded in a formalism, which is potentially more succinct. The motivation for this work is twofold. On the one hand, our tool generates challenging ...
متن کاملExtension Variables in QBF Resolution
We investigate two QBF resolution systems that use extension variables: weak extended Q-resolution, where the extension variables are quantified at the innermost level, and extended Q-resolution, where the extension variables can be placed inside the quantifier prefix. These systems have been considered previously by (Jussila et al. 2007), who give experimental evidence that extended Q-resoluti...
متن کاملFeasible Interpolation for QBF Resolution Calculi
In sharp contrast to classical proof complexity we are currently short of lower bound techniques for QBF proof systems. In this paper we establish the feasible interpolation technique for all resolution-based QBF systems, whether modelling CDCL or expansion-based solving. This both provides the first general lower bound method for QBF proof systems as well as largely extends the scope of classi...
متن کاملComplexity Results for Classes of Quantificational Formulas
We analyze the computational complexity of determining whether F is satisfiable when F is a formula of the classical predicate calculus obeying certain syntactic restrictions. For example, for the monadic predicate calculus and the Code1 or 3 ’ .. WV3 1.. 3 prefix class we obtain lower and upper nondeterministic time bounds of the form c”/“‘~“. The lower bounds are established by using acceptan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2023
ISSN: ['1076-9757', '1943-5037']
DOI: https://doi.org/10.1613/jair.1.14710