@inproceedings{e408b4e0609647b1890252402f157e48,
title = "From Syntactic Proofs to Combinatorial Proofs",
abstract = "In this paper we investigate Hughes{\textquoteright} combinatorial proofs as a notion of proof identity for classical logic. We show for various syntactic formalisms including sequent calculus, analytic tableaux, and resolution, how they can be translated into combinatorial proofs, and which notion of identity they enforce. This allows the comparison of proofs that are given in different formalisms.",
author = "Matteo Acclavio and Lutz Stra{\ss}burger",
note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 9th International Joint Conference on Automated Reasoning, IJCAR 2018 Held as Part of the Federated Logic Conference, FloC 2018 ; Conference date: 14-07-2018 Through 17-07-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-94205-6\_32",
language = "English",
isbn = "9783319942049",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "481--497",
editor = "Roberto Sebastiani and Didier Galmiche and Stephan Schulz",
booktitle = "Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings",
}