{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T05:26:21Z","timestamp":1780550781597,"version":"3.54.1"},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>QBF solving techniques can be divided into the DPLL-based and expansion-based.<\/jats:p><jats:p>In this paper we look at how these two techniques can be combined while using strategy extraction as a means<\/jats:p><jats:p>of interaction between the two.<\/jats:p><jats:p>Once propagation derives a conflict for one of the players, we analyse the proof of such and devise a strategy for<\/jats:p><jats:p>the opponent.  Subsequently, this strategy is used to constrain the losing player.<\/jats:p><jats:p>The implemented prototype shows feasibility of the approach.<\/jats:p><jats:p>A number of avenues for future research can be envisioned.<\/jats:p><jats:p>Can strategies be employed in a different fashion?<\/jats:p><jats:p>Can better strategy be constructed?<\/jats:p><jats:p>Do the presented techniques generalize beyond QBF?<\/jats:p>","DOI":"10.29007\/4sk1","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:04:15Z","timestamp":1516730655000},"page":"28-13","source":"Crossref","is-referenced-by-count":2,"title":["On Conflicts and Strategies in QBF"],"prefix":"10.29007","volume":"35","author":[{"given":"Nikolaj","family":"Bjorner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikolas","family":"Janota","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Klieber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"11545","event":{"name":"LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:05:16Z","timestamp":1516730716000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/Cd"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/4sk1","relation":{},"ISSN":["2398-7340"],"issn-type":[{"value":"2398-7340","type":"print"}],"subject":[]}}