Provider: Schloss Dagstuhl - Leibniz Center for Informatics
Database: dblp computer science bibliography
Content:text/plain; charset="utf-8"
TY - CPAPER
ID - DBLP:conf/sat/PeitlSS19a
AU - Peitl, Tomás
AU - Slivovsky, Friedrich
AU - Szeider, Stefan
TI - Proof Complexity of Fragments of Long-Distance Q-Resolution.
BT - Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings
SP - 319
EP - 335
PY - 2019//
DO - 10.1007/978-3-030-24258-9_23
UR - https://doi.org/10.1007/978-3-030-24258-9_23
ER -
