6 papers:
CSL-2015-BaazF #logic- Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic (MB, CGF), pp. 94–109.
- CSL-2015-HetzlZ
- Tree Grammars for the Elimination of Non-prenex Cuts (SH, SZ), pp. 110–127.
- CSL-2010-BaazF #logic
- A Resolution Mechanism for Prenex Gödel Logic (MB, CGF), pp. 67–79.
SAT-2010-KlieberSGC #learning- A Non-prenex, Non-clausal QBF Solver with Game-State Learning (WK, SS, SG, EMC), pp. 128–142.
- SAT-2003-EglySTWZ #quantifier
- Comparing Different Prenexing Strategies for Quantified Boolean Formulas (UE, MS, HT, SW, MZ), pp. 214–228.
LICS-1996-DegtyarevV #decidability #logic #problem- Decidability Problems for the Prenex Fragment of Intuitionistic Logic (AD, AV), pp. 503–512.
