On Conflicts and Strategies in QBF

14 pages•Published: December 18, 2015

Nikolaj Bjorner, Mikolas Janota and William Klieber

Abstract

QBF solving techniques can be divided into the DPLL-based and expansion-based.
In this paper we look at how these two techniques can be combined while using strategy extraction as a means
of interaction between the two.
Once propagation derives a conflict for one of the players, we analyse the proof of such and devise a strategy for
the opponent. Subsequently, this strategy is used to constrain the losing player.
The implemented prototype shows feasibility of the approach.
A number of avenues for future research can be envisioned.
Can strategies be employed in a different fashion?
Can better strategy be constructed?
Do the presented techniques generalize beyond QBF?

Keyphrases: conflict analysis, qbf, quantification, strategies

In: Ansgar Fehnker, Annabelle McIver, Geoff Sutcliffe and Andrei Voronkov (editors). LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations, vol 35, pages 28-41.

Links:	https://easychair.org/publications/paper/Cd
	https://doi.org/10.29007/4sk1

BibTeX entry

@inproceedings{LPAR-20:Conflicts_Strategies_QBF,
  author    = {Nikolaj Bjorner and Mikolas Janota and William Klieber},
  title     = {On Conflicts and Strategies in QBF},
  booktitle = {LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations},
  editor    = {Ansgar Fehnker and Annabelle McIver and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {35},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Cd},
  doi       = {10.29007/4sk1},
  pages     = {28-41},
  year      = {2015}}

Download PDF Open PDF in browser