Bound Propagation meets Constraint Simplification: Improving Logic-based XAI for Neural Networks
Logic-based methods for explaining neural network decisions offer formal guarantees of correctness and non-redundancy, but they often suffer from high computational costs, especially for large networks. In this work, we improve the efficiency of such methods by combining bound propagation with constraint simplification. These simplifications, derived from the propagation, tighten neuron bounds and eliminate unnecessary binary variables, making the explanation process more efficient. Our experiments suggest that combining these techniques reduces explanation time by up to 89.26\%, particularly for larger neural networks.
| Authors | Ronaldo Gomes, Jairo Ribeiro, Luiz Queiroz et al. |
|---|---|
| Primary category | cs.LO |
| Published | 2 March 2026 |
| Last updated at source | 2 March 2026 |
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.