Proof Complexity of Fragments of Long-Distance Q-resolution

Abstract

Full Citation:

Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider. Proof Complexity of Fragments of Long-Distance Q-resolution. Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 319–335, 2019, Springer Verlag.

Tomas Peitl

Tomáš Peitl is a Project Assistant at the Algorithms and Complexity Group.

Stefan Szeider

Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.