Qute in the QBF Evaluation 2018

Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider, Martina Seidl, Luca Pulina
2019 Journal on Satisfiability, Boolean Modeling and Computation  
Qute is a solver for Quantified Boolean Formulas (QBFs) based on Quantified Conflict-Driven Constraint Learning (QCDCL). Its main distinguishing feature is dependency learning, a lazy technique for relaxing restrictions on the order of variable assignments imposed by nested quantifiers. In this short note, we describe the configurations of Qute submitted to QBFEval'18, along with the parameter tuning process that went into creating them.
doi:10.3233/sat190124 fatcat:nmrf5wkuwfheljqzwbceu4uc6q