Short proofs without interference
Logic in Computer Science
2025-08-14 v1
Abstract
Interference is a phenomenon on proof systems for SAT solving that is both counter-intuitive and bothersome when developing proof-logging techniques. However, all existing proof systems that can produce short proofs for all inprocessing techniques deployed by SAT present this feature. Based on insights from propositional dynamic logic, we propose a framework that eliminates interference while preserving the same expressive power of interference-based proofs. Furthermore, we propose a first building blocks towards RUP-like decision procedures for our dynamic logic-based frameworks, which are essential to developing effective proof checking methods.
Cite
@article{arxiv.2508.09851,
title = {Short proofs without interference},
author = {Adrian Rebola-Pardo},
journal= {arXiv preprint arXiv:2508.09851},
year = {2025}
}