6 papers:
SAT-2009-BeyersdorffM #question- Does Advice Help to Prove Propositional Tautologies? (OB, SM), pp. 65–72.
ICALP-v1-2006-KojevnikovI #bound #calculus #proving- Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies (AK, DI), pp. 323–334.
CSL-2000-DanosK- Disjunctive Tautologies as Synchronisation Schemes (VD, JLK), pp. 292–301.
- CSL-1993-BaazZ #equivalence #proving #using
- Short Proofs of Tautologies Using the Schema of Equivalence (MB, RZ), pp. 33–35.
CADE-1982-HornigB #algorithm- Improvements of a Tautology-Testing Algorithm (KMH, WB), pp. 326–341.
STOC-1981-KrishnamurthyM #calculus- Examples of Hard Tautologies in the Propositional Calculus (BK, RNM), pp. 28–37.
