The Potential of Interference-Based Proof Systems

4 pages•Published: 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.

Links:	https://easychair.org/publications/paper/TWVW
	https://doi.org/10.29007/vr7n

BibTeX entry

@inproceedings{ARCADE2017:Potential_Interference_Based_Proof,
  author    = {Marijn Heule and Benjamin Kiesl},
  title     = {The Potential of Interference-Based Proof Systems},
  booktitle = {ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements},
  editor    = {Giles Reger and Dmitriy Traytel},
  series    = {EPiC Series in Computing},
  volume    = {51},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/TWVW},
  doi       = {10.29007/vr7n},
  pages     = {51-54},
  year      = {2017}}

Download PDF Open PDF in browser