Tobias Philipp

From International Center for Computational Logic

M. Sc. Tobias Philipp

Research AssociateTechnische Universität DresdenInternational Center for Computational Logic Knowledge Representation and Reasoning

Since December 2013, I am a research assistant in the knowledge representation and reasoning group at the Institute for Artificial Intelligence at the Faculty of Computer Science at the Technische Universität Dresden. My research interests comprise parallel SAT solving and verification of SAT solvers.

Newest Publications

View full publication list

Tobias Philipp
Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers
Vienna Austria - Pragmatics of SAT 2014, July 2014
Details

Tobias Philipp
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers
Vienna Austria - Pragmatics of SAT 2014, July 2014
Details

Tobias Philipp
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers
Stavropol, Russian Federation - Young Scientists' International Workshop on Trends in Information Processing, April 2014
Details

Marijn J.H. Heule, Norbert Manthey, Tobias Philipp
Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers
In Daniel Le Berre, eds., Pragmatics of SAT 2014, volume 27 of EPiC Series, 12-25, 2014. EasyChair
Details

Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke
Generic CDCL – A Formalization of Modern Propositional Satisfiability Solvers
In Steffen Hölldobler and Andrey Malikov and Christoph Wernhard, eds., Proceedings of the Young Scientists' International Workshop on Trends in Information Processing, 2014
Details

Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke
Generic CDCL – A Formalization of Modern Propositional Satisfiability Solvers
In Daniel Le Berre, eds., POS-14, volume 27 of EPiC Series, 89-102, 2014. EasyChair
Details

Tobias Philipp
Clause Simplifications in Search-Space Decomposition-Based SAT Solvers
In Ulle Endriss, João Leite, eds., 7th European Starting AI Researcher Symposium (STAIRS), volume 264 of Frontiers in Artificial Intelligence and Applications, 211-219, 2014. IOS Press
Details

Norbert Manthey, Tobias Philipp, Peter Steinke
A More Compact Translation of Pseudo-Boolean Constraints into CNF such that Generalized Arc Consistency is Maintained
In Carsten Lutz and Michael Tielscher, eds., KI 2014: Advances in Artificial Intelligence, volume 8736 of Lecture Notes in Computer Science, 123-134, 2014. Springer
Details

Norbert Manthey, Tobias Philipp
Formula Simplifications as DRAT Derivations
In Carsten Lutz and Michael Tielscher, eds., KI 2014: Advances in Artificial Intelligence, volume 8736 of Lecture Notes in Computer Science, 111-122, 2014. Springer
Details

Norbert Manthey, Tobias Philipp, Christoph Wernhard
Soundness of Inprocessing in Clause Sharing SAT Solvers
In Matti Järvisalo and Allen Van Gelder, eds., Theory and Applications of Satisfiability Testing, 16th International Conference, SAT 2013, volume 7962 of LNCS, 22-39, 2013. Springer
Details

View full publication list

Courses


Suggested Thesis Topics