Phase Transition for Random Quantified XOR-Formulas
Creignou, N., Daude, H., Egly, U.
–Journal of Artificial Intelligence Research
The QXOR-SAT problem is the quantified version of the satisfiability problem XOR-SAT in which the connective exclusive-or is used instead of the usual or. We study the phase transition associated with random QXOR-SAT instances. We give a description of this phase transition in the case of one alternation of quantifiers, thus performing an advanced practical and theoretical study on the phase transition of a quantified problem.
Journal of Artificial Intelligence Research
May-10-2007
- Country:
- Africa > Sudan (0.04)
- North America > United States
- Pennsylvania > Philadelphia County > Philadelphia (0.04)
- Europe
- Austria (0.04)
- France > Provence-Alpes-Côte d'Azur
- Bouches-du-Rhône > Marseille (0.04)
- Technology: