Proof Logging for Smart Extensional Constraints

McIlree, M. J. and Mccreesh, C. (2023) Proof Logging for Smart Extensional Constraints. In: 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), Toronto, ON, Canada, 27-31 Aug 2023, 26:1-26:17. ISBN 9783959773003 (doi: 10.4230/LIPIcs.CP.2023.26)

[img] Text
302858.pdf - Published Version
Available under License Creative Commons Attribution.



Proof logging provides an auditable way of guaranteeing that a solver has produced a correct answer using sound reasoning. This is standard practice for Boolean satisfiability solving, but for constraint programming, a challenge is that every propagator must be able to justify all inferences it performs. Here we demonstrate how to support proof logging for a wide range of previously uncertified global constraints. We do this by showing how to justify every inference that could be performed by the propagation algorithms for two families of generalised extensional constraint: "Smart Table" and "Regular Language Membership".

Item Type:Conference Proceedings
Additional Information:Funding: Part of this work was done while the authors were participating in a programme at the Simons Institute for the Theory of Computing. Ciaran McCreesh: Supported by a Royal Academy of Engineering research fellowship.
Glasgow Author(s) Enlighten ID:McIlree, Matthew and Mccreesh, Dr Ciaran
Authors: McIlree, M. J., and Mccreesh, C.
College/School:College of Science and Engineering
College of Science and Engineering > School of Computing Science
Copyright Holders:Copyright © Matthew J. McIlree and Ciaran McCreesh
First Published:First published in 29th International Conference on Principles and Practice of Constraint Programming (CP 2023) LIPICS 280:26:1-26:17
Publisher Policy:Reproduced under a Creative Commons license
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record