A Model for Generating Random Quantified Boolean Formulas

Chen, Hubie; Interian, Yannet

A Model for Generating Random Quantified Boolean Formulas

Download BibTeX Cite

Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 66-70.

Abstract

The quantified boolean formula (QBF) problem is a powerful generalization of the boolean satisfiability (SAT) problem where variables can be both universally and existentially quantified. Inspired by the fruitfulness of the established model for generating random SAT instances, we define and study a general model for generating random QBF instances. We exhibit experimental results showing that our model bears certain desirable similarities to the random SAT model, as well as a number of theoretical results concerning our model.

Hubie Chen, and Yannet Interian. 2005. A Model for Generating Random Quantified Boolean Formulas. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 66–70. https://ijcai.org/proceedings/2005/57

@inproceedings{ijcai2005p57,
  title     = {A Model for Generating Random Quantified Boolean Formulas},
  author    = {Chen, Hubie and Interian, Yannet},
  booktitle = {Proceedings of the Nineteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-05}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {66--70},
  year      = {2005},
  url       = {https://ijcai.org/proceedings/2005/57},
}

TY  - CPAPER
TI  - A Model for Generating Random Quantified Boolean Formulas
AU  - Chen, Hubie
AU  - Interian, Yannet
T2  - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2005
SP  - 66
EP  - 70
UR  - https://ijcai.org/proceedings/2005/57
ER  -