Abstract
We describe the design and implementation of a new constraint programming solver that can produce an auditable record of what problem was solved and how the solution was reached. As well as a solution, this solver provides an independently verifiable proof log demonstrating that the solution is correct. This proof log uses the VeriPB proof system, which is based upon cutting planes reasoning with extension variables. We explain how this system can support global constraints, variables with large domains, and reformulation, despite not natively understanding any of these concepts.
| Originalsprog | Engelsk |
|---|---|
| Titel | 28th International Conference on Principles and Practice of Constraint Programming, CP 2022 |
| Redaktører | Christine Solnon |
| Forlag | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| Publikationsdato | 2022 |
| Artikelnummer | 25 |
| ISBN (Elektronisk) | 9783959772402 |
| DOI | |
| Status | Udgivet - 2022 |
| Begivenhed | 28th International Conference on Principles and Practice of Constraint Programming, CP 2022 - Haifa, Israel Varighed: 31 jul. 2022 → 8 aug. 2022 |
Konference
| Konference | 28th International Conference on Principles and Practice of Constraint Programming, CP 2022 |
|---|---|
| Land/Område | Israel |
| By | Haifa |
| Periode | 31/07/2022 → 08/08/2022 |
| Navn | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Vol/bind | 235 |
| ISSN | 1868-8969 |
Bibliografisk note
Funding Information:Supplementary Material Source code for the solver described in this paper can be found here: Software (Source Code): https://doi.org/10.5281/zenodo.6514093 Funding Stephan Gocht: Supported by the Swedish Research Council grant 2016-00782. Ciaran McCreesh: Supported by a Royal Academy of Engineering research fellowship. Jakob Nordström: Supported by the Swedish Research Council grant 2016-00782 and the Independent Research Fund Denmark grant 9040-00389B.
Publisher Copyright:
© Stephan Gocht, Ciaran McCreesh, and Jakob Nordström.