Gocht, S., Mccreesh, C. and Nordström, J. (2022) An Auditable Constraint Programming Solver. In: 28th International Conference on Principles and Practice of Constraint Programming (CP2022), Haifa, Israel, 31 July-5 Aug 2022, p. 25. ISBN 9783959772402 (doi: 10.4230/LIPIcs.CP.2022.25)
![[img]](https://eprints.gla.ac.uk/style/images/fileicons/text.png) |
Text
270514.pdf - Published Version Available under License Creative Commons Attribution. 665kB |
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.
| Item Type: | Conference Proceedings |
|---|---|
| Additional Information: | 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 |
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Mccreesh, Dr Ciaran |
| Authors: | Gocht, S., Mccreesh, C., and Nordström, J. |
| College/School: | College of Science and Engineering > School of Computing Science |
| ISBN: | 9783959772402 |
| Related URLs: |
University Staff: Request a correction | Enlighten Editors: Update this record
Deposit and Record Details
Deposit and Record Details