Download PDFOpen PDF in browser

The Potential of Interference-Based Proof Systems

4 pagesPublished: November 8, 2017

Abstract

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.

Keyphrases: automated reasoning, calculi, first-order logic, proofs, QBF, satisfiability

In: Giles Reger and Dmitriy Traytel (editors). ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, vol 51, pages 51--54

Download PDFOpen PDF in browser