Abstract
We present an overview of models of random quantified boolean formulas and their natural random disjunctive ASP program counterparts 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.
Original language | English |
---|---|
Pages (from-to) | 174-178 |
Number of pages | 5 |
Journal | CEUR Workshop Proceedings |
Volume | 2243 |
State | Published - 2018 |
Event | 19th Italian Conference on Theoretical Computer Science, ICTCS 2018 - Urbino, Italy Duration: Sep 18 2018 → Sep 20 2018 |
Bibliographical note
Publisher Copyright:© 2018 CEUR-WS. All rights reserved.
Keywords
- ASP
- QBF
- Random models
ASJC Scopus subject areas
- General Computer Science