Navigation: Front Page Proof Format Overview Publications
Please cite up to three of the following references in this order of priority. You can click on the references to get their BibTeX entry:
Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, and Jakob Nordström.
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation.
Journal of Artificial Intelligence Research, 2023.
@article{BGMN23Dominance,
author = {Bart Bogaerts and Stephan Gocht and Ciaran McCreesh
and Jakob Nordström},
title = {Certified Dominance and Symmetry Breaking for
Combinatorial Optimisation},
year = {2023},
month = aug,
journal = {Journal of Artificial Intelligence Research},
volume = {77},
pages = {1539\nobreakdash--1589},
note = {Preliminary version in \emph{AAAI~'22}},
}
Stephan Gocht, and Jakob Nordström.
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs.
Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI '21), 2021.
@inproceedings{GN21CertifyingParity,
author = {Stephan Gocht and Jakob Nordström},
title = {Certifying Parity Reasoning Efficiently Using
Pseudo-{B}oolean Proofs},
year = {2021},
month = feb,
booktitle = {Proceedings of the 35th {AAAI} Conference on
Artificial Intelligence ({AAAI}~'21)},
pages = {3768\nobreakdash--3777}
}
Stephan Gocht.
Certifying Correctness for Combinatorial Algorithms by Using Pseudo-Boolean Reasoning.
Lund University, Lund, Sweden, 2022.
@phdthesis{Gocht22Thesis,
author = {Stephan Gocht},
title = {Certifying Correctness for Combinatorial Algorithms
by Using Pseudo-{B}oolean Reasoning},
school = {Lund University},
address = {Lund, Sweden},
year = {2022},
month = jun,
note = {Available at
\url{https://portal.research.lu.se/en/publications/certifying-correctness-for-combinatorial-algorithms-by-using-pseu}},
}
The following is a list of scientific publications that make use of (some version of) VeriPB.