| 2018 | SAT | Checking Unsatisfiability Proofs in Parallel. | Norbert Manthey, Tobias Philipp |
| 2017 | FlAIRS | Fuzzing and Verifying RAT Refutations with Deletion Information. | Walter Forkel, Tobias Philipp, Adrian Rebola-Pardo, Elias Werner |
| 2017 | LPAR | Towards a Semantics of Unsatisfiability Proofs with Inprocessing. | Tobias Philipp, Adrin Rebola-Pardo |
| 2017 | LPNMR | Contextual Abduction and its Complexity Issues. | Emmanuelle-Anna Dietz Saldanha, Steffen Hlldobler, Tobias Philipp |
| 2016 | JELIA | DRAT Proofs for XOR Reasoning. | Tobias Philipp, Adrian Rebola-Pardo |
| 2015 | SAT | PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF. | Tobias Philipp, Peter Steinke |
| 2014 | KI | Formula Simplifications as DRAT Derivations. | Norbert Manthey, Tobias Philipp |
| 2014 | KI | A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained. | Norbert Manthey, Tobias Philipp, Peter Steinke |
| 2014 | SAT | Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers. | Marijn Heule, Norbert Manthey, Tobias Philipp |
| 2014 | SAT | Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers. | Steffen Hlldobler, Norbert Manthey, Tobias Philipp, Peter Steinke |
| 2013 | SAT | Soundness of Inprocessing in Clause Sharing SAT Solvers. | Norbert Manthey, Tobias Philipp, Christoph Wernhard |