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.

Document Type

Conference Proceeding

Publication Date


Notes/Citation Information

Published in Proceedings of the 19th Italian Conference on Theoretical Computer Science, v. 2243, session 4, p. 1-5.

Copyright © 2018 for the individual papers by the papers' authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors

The copyright holders have granted the permission for posting the article here.