TP

Tobias Philipp

Sort by
An Expressive Model for Instance Decomposition Based Parallel SAT Solvers
Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing
A Verified Decision Procedure for Pseudo-Boolean Formulas
PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF
The Complexity of Contextual Abduction in Human Reasoning Tasks
Checking Unsatisfiability Proofs in Parallel
Anwendungen der Logik in der IT-Sicherheit
Formal Verification with Ada/SPARK
Formale Verifikation von Answer Set Programming