Publikationen zu Logik
U. Bubeck, H. Kleine Büning.
Encoding Nested Boolean Functions as Quantified Boolean Formulas.
In Journal on Satisfiability, Boolean Modeling and Computation (JSAT), vol. 8, no. 1, pp. 101-116, IOS Press, 2012.
[Show BibTeX]
Encoding Nested Boolean Functions as Quantified Boolean Formulas.
In Journal on Satisfiability, Boolean Modeling and Computation (JSAT), vol. 8, no. 1, pp. 101-116, IOS Press, 2012.
[Show BibTeX]
@article{Bubeck-2012a,H. Kleine Büning, X. Zhao, U. Bubeck.
Transformations into Normal Forms for Quantified Circuits.
In Proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing (SAT 2011). Springer, Lecture Notes in Computer Science, vol. 6695, pp. 245-258, 2011.
[Show BibTeX]
Transformations into Normal Forms for Quantified Circuits.
In Proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing (SAT 2011). Springer, Lecture Notes in Computer Science, vol. 6695, pp. 245-258, 2011.
[Show BibTeX]
U. Bubeck.Wolfgang Bibel (eds.):
Model-Based Transformations for Quantified Boolean Formulas., vol. 329
. IOS Press 2010.
[Show BibTeX]
Model-Based Transformations for Quantified Boolean Formulas., vol. 329
. IOS Press 2010.
[Show BibTeX]
U. Bubeck, H. Kleine Büning.
The Power of Auxiliary Variables for Propositional and Quantified Boolean Formulas.
In Studies in Logic, vol. 3, no. 3, pp. 1-23, , 2010.
[Show BibTeX]
The Power of Auxiliary Variables for Propositional and Quantified Boolean Formulas.
In Studies in Logic, vol. 3, no. 3, pp. 1-23, , 2010.
[Show BibTeX]
C. Peschiera, L. Pulina, A. Tacchella, U. Bubeck, O. Kullmann, I. Lynce.
The Seventh QBF Solvers Evaluation (QBFEVAL'10).
In Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing (SAT 2010). Springer, Lecture Notes in Computer Science, vol. 6175, pp. 237-250, 2010.
[Show BibTeX]
The Seventh QBF Solvers Evaluation (QBFEVAL'10).
In Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing (SAT 2010). Springer, Lecture Notes in Computer Science, vol. 6175, pp. 237-250, 2010.
[Show BibTeX]
U. Bubeck, H. Kleine Büning.
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN.
In Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing (SAT 2010). Springer, Lecture Notes in Computer Science, vol. 6175, pp. 58-70, 2010.
[Show BibTeX]
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN.
In Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing (SAT 2010). Springer, Lecture Notes in Computer Science, vol. 6175, pp. 58-70, 2010.
[Show BibTeX]
H. Kleine Büning, X. Zhao, U. Bubeck.
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.
In Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT 2009). Springer, Lecture Notes in Computer Science, vol. 5584, pp. 391-397, 2009.
[Show BibTeX]
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.
In Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT 2009). Springer, Lecture Notes in Computer Science, vol. 5584, pp. 391-397, 2009.
[Show BibTeX]
H. Kleine Büning, U. Bubeck.
Theory of Quantified Boolean Formulas.
In Biere, Armin and Heule, Marijin and van Maaren, Hans and Walsh, Toby (eds.): Handbook of Satisfiability, pp. 735-760,. IOS Press 2009.
[Show BibTeX]
Theory of Quantified Boolean Formulas.
In Biere, Armin and Heule, Marijin and van Maaren, Hans and Walsh, Toby (eds.): Handbook of Satisfiability, pp. 735-760,. IOS Press 2009.
[Show BibTeX]
U. Bubeck, H. Kleine Büning.
A new 3-CNF Transformation by Parallel-Serial Graphs.
In Information Processing Letters, vol. 109, no. 7, pp. 376-379, , 2009.
[Show BibTeX]
A new 3-CNF Transformation by Parallel-Serial Graphs.
In Information Processing Letters, vol. 109, no. 7, pp. 376-379, , 2009.
[Show BibTeX]
U. Bubeck, H. Kleine Büning.
Models and Quantifier Elimination for Quantified Horn Formulas.
In Discrete Applied Mathematics, vol. 156, no. 10, pp. 1606-1622, , 2008.
[Show BibTeX]
Models and Quantifier Elimination for Quantified Horn Formulas.
In Discrete Applied Mathematics, vol. 156, no. 10, pp. 1606-1622, , 2008.
[Show BibTeX]
U. Bubeck, H. Kleine Büning.
Bounded Universal Expansion for Preprocessing QBF.
In Marques-Silva, Joao and Sakallah, Karem (eds.): Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing (SAT 2007). Springer, Lecture Notes in Computer Science, vol. 4501, pp. 244-257, 2007.
[Show BibTeX]
Bounded Universal Expansion for Preprocessing QBF.
In Marques-Silva, Joao and Sakallah, Karem (eds.): Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing (SAT 2007). Springer, Lecture Notes in Computer Science, vol. 4501, pp. 244-257, 2007.
[Show BibTeX]
U. Bubeck, H. Kleine Büning.
Dependency Quantified Horn Formulas: Models and Complexity.
In Biere, Armin and Gomes, Carla (eds.): Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT 2006). Springer, Lecture Notes in Computer Science, vol. 4121, pp. 198-211, 2006.
[Show BibTeX]
Dependency Quantified Horn Formulas: Models and Complexity.
In Biere, Armin and Gomes, Carla (eds.): Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT 2006). Springer, Lecture Notes in Computer Science, vol. 4121, pp. 198-211, 2006.
[Show BibTeX]
U. Bubeck, H. Kleine Büning, X. Zhao.
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.
In Bacchus, Fahiem and Walsh, Toby (eds.): Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT 2005). Springer, Lecture Notes in Computer Science, vol. 3569, pp. 386-392, 2005.
[Show BibTeX]
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.
In Bacchus, Fahiem and Walsh, Toby (eds.): Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT 2005). Springer, Lecture Notes in Computer Science, vol. 3569, pp. 386-392, 2005.
[Show BibTeX]