Tobias Philipp
Aus International Center for Computational Logic
M. Sc. Tobias Philipp
Doktorand
- tobias.philipp@tu-dresden.de
- +49 351 463 38547
- APB 2019
- Do, 14:50 – 16:20 Uhr
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, Valentin Roland, Lukas Schweizer
Smoke Test Planning using Answer Set Programming
International Journal of Interactive Multimedia and Artificial Intelligence, 6(5):57--65, February 2021
Details Download
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
Lehrveranstaltungen
- Science of Computational Logic (WS 2016)
- Logic (WS 2016)
- Theoretische Informatik und Logik (SS 2016)
- Formale Systeme (WS 2015)
- Logic (WS 2015)
weitere Lehrveranstaltungen anzeigen
