Random Models of Very Hard 2QBF and Disjunctive Programs: An Overview
Giovanni Amendola, Francesco Ricca, Mirosław Truszczyński · UKnowledge (University of Kentucky) · 2018
We present an overview of models of random quantified boolean formulas and their natural random disjunctive ASP program counter-parts that we have recently proposed. The models have a simple structure but also theoretical and empirical properties that make them useful for further advancement of the SAT, QBF and ASP solvers.