{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:46:58Z","timestamp":1753886818655},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>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<\/jats:p><jats:p>can change the models of a given set of formulas.<\/jats:p>","DOI":"10.29007\/vr7n","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:06:06Z","timestamp":1516730766000},"page":"51-46","source":"Crossref","is-referenced-by-count":3,"title":["The Potential of Interference-Based Proof Systems"],"prefix":"10.29007","volume":"51","author":[{"given":"Marijn","family":"Heule","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Kiesl","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:06:08Z","timestamp":1516730768000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/TWVW"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/vr7n","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}