A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Polynomial Simulation and Refutation of Complex Formulas of Resolution over Linear Equations in Propositional Proof System
2014
American Journal of Modeling and Optimization
In this paper, we present that the propositional proof system R(lin) (Resolution over Linear Equations) established by Ran Raz and Iddo Tzameret is not a super system, there exists a sequence of tautologies, which require proof complexity exponential in size of tautologies. We show that there are the sequence of unsatisfiable collections of disjuncts of linear equations, which require exponential lower bounds in R(lin) and have polynomially bounded refutations by incorporating renaming
doi:10.12691/ajmo-2-1-5
fatcat:qoik3kdlbrbatnjbchzqto2maa