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
2+p-SAT: relation of typical-case complexity to the nature of the phase transition
Random Structures & Algorithms - Special issue on statistical physics methods in discrete probability, combinatorics, and theoretical computer science
A solver for QBFs in negation normal form
Constraints
(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
Beyond CNF: A Circuit-Based QBF Solver
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Generation of hard non-clausal random satisfiability problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A model for generating random quantified boolean formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Automated testing and debugging of SAT and QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
A non-prenex, non-clausal QBF solver with game-state learning
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
We present the framework [q]bfGen which allows the declarative specification of random models for generating SAT and QSAT formulas not necessarily in (prenex) conjunctive normal form. To this end, [q]bfGen realizes a generic formula generator which creates formula instances by interpreting the random model specification expressed in XML. Consequently, the implementation of specific random formula generators becomes obsolete, because our framework subsumes their functionality.