A model for generating random quantified boolean formulas

Authors:
Hubie Chen;Yannet Interian
Affiliations:
Departament de Tecnologia, Universitat Pompeu Fabra, Barcelona, Spain;Center for Applied Mathematics, Cornell University, Ithaca, New York
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 4
Cited 8

Many hard examples for resolution

Journal of the ACM (JACM)
Beyond NP: the QSAT phase transition

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Typical random 3-SAT formulae and the satisfiability threshold

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning

Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers

Journal of Algorithms
Empirical Study of Relational Learning Algorithms in the Phase Transition Framework

ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Phase transition for random quantified XOR-formulas

Journal of Artificial Intelligence Research
Experimenting with look-back heuristics for hard ASP programs

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
New results on the phase transition for random quantified Boolean formulas

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Automated testing and debugging of SAT and QBF solvers

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
The seventh QBF solvers evaluation (QBFEVAL’10)

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
A framework for the specification of random SAT and QSAT formulas

TAP'12 Proceedings of the 6th international conference on Tests and Proofs

Quantified Score

Hi-index	0.00

Visualization

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.