The Potential of Interference-Based Proof Systems
Marijn J. H. Heule, Benjamin Kiesl · EPiC series in computing · 2018
In our extended abstract, we try to motivate researchers to investigate the potential of proof systems that modify a given set of formulas (e.g., a set of clauses in propositional logic) in a way that preserves satisfiability but not necessarily logical equivalence. We call such modifications interferences, because they can change the models of a given set of formulas.