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.
Amendola, Giovanni; Ricca, Francesco; and Truszczynski, Miroslaw, "Random Models of Very Hard 2QBF and Disjunctive Programs: An Overview" (2018). Computer Science Faculty Publications. 19.