Tobias Philipp

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

M. Sc. Tobias Philipp

Wissenschaftlicher MitarbeiterTechnische Universität DresdenInternational Center for Computational Logic Wissensverarbeitung

Ich bin seit Dezember 2013 Doktorand bei der Professur für Wissensverarbeitung im Institut Künstliche Intelligenz an der Fakultät Informatik der TU Dresden. Meine Forschungsinteressen umfassen paralleles Lösen von SAT Problemen und Verifikation von SAT Solvern.

Neueste Publikationen

Komplette Publikationsliste anzeigen

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

Komplette Publikationsliste anzeigen

Lehrveranstaltungen


Themenvorschläge für Studien- und Abschlussarbeiten