Justifying All Differences Using Pseudo-Boolean Reasoning

Constraint programming solvers support rich global constraints and propagators, which make them both powerful and hard to debug. In the Boolean satisfiability community, prooflogging is the standard solution for generating trustworthy outputs, and this has become key to the social acceptability of computer-generated proofs. However, reusing this technology for constraint programming requires either much weaker propagation, or an impractical blowup in proof length. This paper demonstrates that simple, clean, and efficient proof logging is still possible for the all-different constraint, through pseudo-Boolean reasoning. We explain how such proofs can be expressed and verified mechanistically, describe an implementation, and discuss the broader implications for proof logging in constraint programming.

Authors

• Jan Elffers
• Stephan Gocht Lund University, Lund, Sweden University of Copenhagen, Copenhagen, Denmark
• Ciaran McCreesh University of Glasgow, Scotland (UK)
• Jakob Nordstr”öm

Keywords

No keywords are indexed for this paper.