Random models of very hard 2QBF and disjunctive programs: An overview

Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski

Research output: Contribution to journalConference articlepeer-review

7 Scopus citations

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 languageEnglish
Pages (from-to)174-178
Number of pages5
JournalCEUR Workshop Proceedings
Volume2243
StatePublished - 2018
Event19th Italian Conference on Theoretical Computer Science, ICTCS 2018 - Urbino, Italy
Duration: Sep 18 2018Sep 20 2018

Keywords

  • ASP
  • QBF
  • Random models

ASJC Scopus subject areas

  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Random models of very hard 2QBF and disjunctive programs: An overview'. Together they form a unique fingerprint.

Cite this