Tobias Philipp

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 16

Top Topics

Logic Programming

Propositional Satisfiability

Generalized Arc Consistency

Top Venues

Publications

Emmanuelle Dietz, Tobias Philipp, Gerrit Schramm, Andreas Zindel
A Logic Programming Approach to Global Logistics in a Co-Design Environment. CoRR (2023)
André Dietrich, Christopher Schmidt, Nico Enghardt, Tobias Philipp
Lazily-Verifiable SAT Proof Checker in SPARK 2014. Datenschutz und Datensicherheit 47 (8) (2023)
Rachel Heyard, Tobias Philipp, Hanna Hottenrott
Imaginary carrot or effective fertiliser? A rejoinder on funding and productivity. Scientometrics 126 (11) (2021)
Tobias Philipp, Valentin Roland, Lukas Schweizer
Smoke Test Planning using Answer Set Programming. Int. J. Interact. Multim. Artif. Intell. 6 (5) (2021)
Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath
Inconsistency Proofs for ASP: The ASP-DRUPE Format. CoRR (2019)
Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath
Inconsistency Proofs for ASP: The ASP - DRUPE Format. Theory Pract. Log. Program. 19 (5-6) (2019)
Norbert Manthey, Tobias Philipp
Checking Unsatisfiability Proofs in Parallel. POS@SAT (2018)
Emmanuelle-Anna Dietz Saldanha, Steffen Hölldobler, Tobias Philipp
The Complexity of Contextual Abduction in Human Reasoning Tasks. YSIP (2017)
Walter Forkel, Tobias Philipp, Adrian Rebola-Pardo, Elias Werner
Fuzzing and Verifying RAT Refutations with Deletion Information. FLAIRS Conference (2017)
Tobias Philipp, Adrián Rebola-Pardo
Towards a Semantics of Unsatisfiability Proofs with Inprocessing. LPAR (2017)
Emmanuelle-Anna Dietz Saldanha, Steffen Hölldobler, Tobias Philipp
Contextual Abduction and its Complexity Issues. DARe@LPNMR (2017)
Tobias Philipp
Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing. GCAI (2016)
Tobias Philipp, Adrian Rebola-Pardo
DRAT Proofs for XOR Reasoning. JELIA (2016)
Tobias Philipp, Anna Tigunova
A Verified Decision Procedure for Pseudo-Boolean Formulas. PlanSIG (2016)
Tobias Philipp
An Expressive Model for Instance Decomposition Based Parallel SAT Solvers. FroCos (2015)
Tobias Philipp, Peter Steinke
PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF. SAT (2015)
Norbert Manthey, Tobias Philipp
Formula Simplifications as DRAT Derivations. KI (2014)
Marijn Heule, Norbert Manthey, Tobias Philipp
Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers. POS@SAT (2014)
Tobias Philipp
Clause Simplifications in Search-Space Decomposition-Based Sat Solvers. STAIRS (2014)
Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers. YSIP (2014)
Norbert Manthey, Tobias Philipp, Peter Steinke
A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained. KI (2014)
Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers. POS@SAT (2014)
Norbert Manthey, Tobias Philipp, Christoph Wernhard
Soundness of Inprocessing in Clause Sharing SAT Solvers. SAT (2013)
Domenico Martino, Tobias Philipp
Plattformen für mobile Geschäftsanwendungen - am Beispiel der Sybase Unwired Platform. HMD Prax. Wirtsch. 286 (2012)
Steffen Hölldobler, Tobias Philipp, Christoph Wernhard
An Abductive Model for Human Reasoning. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning (2011)