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]
@inproceedings{Philipp16,
title = {Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing},
author = {Tobias Philipp},
year = {2016},
url = {http://www.easychair.org/publications/paper/Unsatisfiability_Proofs_for_Parallel_SAT_Solver_Portfolios_with_Clause_Sharing_and_Inprocessing},
researchr = {https://researchr.org/publication/Philipp16},
cites = {0},
citedby = {0},
pages = {24-38},
booktitle = {GCAI 2016. 2nd Global Conference on Artificial Intelligence, September 19 - October 2, 2016, Berlin, Germany},
editor = {Christoph Benzmüller and Geoff Sutcliffe and Raúl Rojas},
volume = {41},
series = {EPiC Series in Computing},
publisher = {EasyChair},
}