Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing

Tobias Philipp. Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing. In Christoph Benzmüller, Geoff Sutcliffe, Raúl Rojas, editors, GCAI 2016. 2nd Global Conference on Artificial Intelligence, September 19 - October 2, 2016, Berlin, Germany. Volume 41 of EPiC Series in Computing, pages 24-38, EasyChair, 2016. [doi]

Abstract

Abstract is missing.