An Abductive Model for Human Reasoning. - Steffen Hölldobler; Tobias Philipp; Christoph Wernhard (AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning, 2011)

Plattformen für mobile Geschäftsanwendungen - am Beispiel der Sybase Unwired Platform. - Domenico Martino; Tobias Philipp (HMD Prax. Wirtsch., 2012)

Soundness of Inprocessing in Clause Sharing SAT Solvers. - Norbert Manthey; Tobias Philipp; Christoph Wernhard (SAT, 2013)

Formula Simplifications as DRAT Derivations. - Norbert Manthey; Tobias Philipp (KI, 2014)

A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained. - Norbert Manthey; Tobias Philipp; Peter Steinke (KI, 2014)

Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers. - Marijn Heule; Norbert Manthey; Tobias Philipp (POS@SAT, 2014)

Clause Simplifications in Search-Space Decomposition-Based Sat Solvers. - Tobias Philipp (STAIRS, 2014)

Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers. - Steffen Hölldobler; Norbert Manthey; Tobias Philipp; Peter Steinke (YSIP, 2014)

An Expressive Model for Instance Decomposition Based Parallel SAT Solvers. - Tobias Philipp (FroCos, 2015)

PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF. - Tobias Philipp; Peter Steinke (SAT, 2015)

Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing. - Tobias Philipp (GCAI, 2016)

DRAT Proofs for XOR Reasoning. - Tobias Philipp; Adrian Rebola-Pardo (JELIA, 2016)

A Verified Decision Procedure for Pseudo-Boolean Formulas. - Tobias Philipp; Anna Tigunova (PlanSIG, 2016)

Fuzzing and Verifying RAT Refutations with Deletion Information. - Walter Forkel; Tobias Philipp; Adrian Rebola-Pardo; Elias Werner (FLAIRS, 2017)

Towards a Semantics of Unsatisfiability Proofs with Inprocessing. - Tobias Philipp; Adrián Rebola-Pardo (LPAR, 2017)

Contextual Abduction and its Complexity Issues. - Emmanuelle-Anna Dietz Saldanha; Steffen Hölldobler; Tobias Philipp (DARe@LPNMR, 2017)

The Complexity of Contextual Abduction in Human Reasoning Tasks. - Emmanuelle-Anna Dietz Saldanha; Steffen Hölldobler; Tobias Philipp (YSIP, 2017)

Checking Unsatisfiability Proofs in Parallel. - Norbert Manthey; Tobias Philipp (POS@SAT, 2018)

Inconsistency Proofs for ASP: The ASP - DRUPE Format. - Mario Alviano; Carmine Dodaro; Johannes Klaus Fichte; Markus Hecher; Tobias Philipp; Jakob Rath (Theory Pract. Log. Program., 2019)

Smoke Test Planning using Answer Set Programming. - Tobias Philipp; Valentin Roland; Lukas Schweizer (Int. J. Interact. Multim. Artif. Intell., 2021)

Imaginary carrot or effective fertiliser? A rejoinder on funding and productivity. - Rachel Heyard; Tobias Philipp; Hanna Hottenrott (Scientometrics, 2021)

A Logic Programming Approach to Global Logistics in a Co-Design Environment. - Emmanuelle Dietz; Tobias Philipp; Gerrit Schramm; Andreas Zindel (ICLP, 2023)

Lazily-Verifiable SAT Proof Checker in SPARK 2014. - André Dietrich; Christopher Schmidt; Nico Enghardt; Tobias Philipp (Datenschutz und Datensicherheit, 2023)