New results on the phase transition for random quantified Boolean formulas

Authors:
Nadia Creignou;Hervé Daudé;Uwe Egly;Raphaël Rossignol
Affiliations:
Université d'Aix-Marseille, Laboratoire d'Informatique Fondamentale, Marseille, France;Université d'Aix-Marseille, Laboratoire d'Analyse, Topologie et Probabilités, Marseille, France;Institut für Informationsysteme, Technische Universität Wien, Wien, Austria;Université de Paris 11, Département de Mathématiques, Orsay Cedex, France
Venue:
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Year:
2008

Citing 8
Cited 2

A threshold for unsatisfiability

Journal of Computer and System Sciences
A general upper bound for the satisfiability threshold of random r-SAT formulae

Journal of Algorithms
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
Subclasses of Quantified Boolean Formulas

CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Mick gets some (the odds are on his side) (satisfiability)

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Phase transition for random quantified XOR-formulas

Journal of Artificial Intelligence Research
A model for generating random quantified boolean formulas

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

(1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms

SAT '09 Proceedings of the 12th 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The QSAT problem is the quantified version of the satisfiability problem SAT. We study the phase transition associated with random QSAT instances. We focus on a certain subclass of closed quantified Boolean formulas that can be seen as quantified extended 2-CNF formulas. The evaluation problem for this class is coNP-complete. We carry out an advanced practical and theoretical study, which illuminates the influence of the different parameters used to define random quantified instances.