352 search results - page 19 / 71 » Proofs as Polynomials |
109
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
ERSHOV
2001
Springer
15 years 2 months ago
2001
Springer
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
91
Voted
TCS
2008
14 years 10 months ago
2008
The purpose of this paper is to decipher constructively a lemma of Suslin which played a central role in his second solution of Serre's problem on projective modules over pol...
108
Voted
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...