HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors

Author:Tobias Philipp

Publications
Checking Unsatisfiability Proofs in Parallel
Norbert Manthey and Tobias Philipp
In:Proceedings of Pragmatics of SAT 2015 and 2018
Towards a Semantics of Unsatisfiability Proofs with Inprocessing
Tobias Philipp and Adrián Rebola-Pardo
In:LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing
Tobias Philipp
In:GCAI 2016. 2nd Global Conference on Artificial Intelligence
Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers
Marijn Heule, Norbert Manthey and Tobias Philipp
In:POS-14. Fifth Pragmatics of SAT workshop
Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers
Steffen Hölldobler, Norbert Manthey, Tobias Philipp and Peter Steinke
In:POS-14. Fifth Pragmatics of SAT workshop

Keyphrases

abstraction, blocked clauses, CDCL algorithm, clause sharing, DRAT, DRAT proofs, formal model, parallel portfolio, parallel satisfiability solver, SAT, SAT solving2, transition system, unsatisfiability proof, unsatisfiability proofs.

Copyright © 2012-2025 easychair.org. All rights reserved.