43 papers:
DLT-2014-Sorokin #context-free grammar- Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars (AS), pp. 154–165.
LATA-2014-Kalocinski #on the- On Computability and Learnability of the Pumping Lemma Function (DK), pp. 433–440.
IJCAR-2014-NigamRL #automation #named #permutation #proving- Quati: An Automated Tool for Proving Permutation Lemmas (VN, GR, LL), pp. 255–261.
DATE-2013-PigorschS #locality- Lemma localization: a practical method for downsizing SMT-interpolants (FP, CS), pp. 1405–1410.
STOC-2013-HarrisS #constraints- Constraint satisfaction, packet routing, and the lovasz local lemma (DGH, AS), pp. 685–694.
- LATA-2012-Rabkin
- Ogden’s Lemma for ET0L Languages (MR), pp. 458–467.
ICALP-v2-2011-SchmitzS #bound #multi #recursion- Multiply-Recursive Upper Bounds with Higman’s Lemma (SS, PS), pp. 441–452.
CSL-2011-Kartzow #automaton #graph- A Pumping Lemma for Collapsible Pushdown Graphs of Level 2 (AK), pp. 322–336.
LICS-2011-FigueiraFSS #bound #recursion- Ackermannian and Primitive-Recursive Bounds with Dickson’s Lemma (DF, SF, SS, PS), pp. 269–278.
- STOC-2010-AmbainisKS #quantum
- A quantum lovász local lemma (AA, JK, OS), pp. 151–160.
- ICALP-v1-2010-Welzl #constraints #satisfiability
- When Conflicting Constraints Can Be Resolved — The Lovász Local Lemma and Satisfiability (EW), p. 18.
SAC-2010-JiaLLZ #satisfiability- Local lemma: a new strategy of pruning in SAT solvers (XJ, RL, SL, JZ), pp. 2071–2072.
- STOC-2009-AharonovALV #detection #quantum
- The detectability lemma and quantum gap amplification (DA, IA, ZL, UVV), pp. 417–426.
- STOC-2009-Moser #proving
- A constructive proof of the Lovász local lemma (RAM), pp. 343–350.
- DLT-2009-Kanazawa #context-free grammar #multi
- The Pumping Lemma for Well-Nested Multiple Context-Free Languages (MK), pp. 312–325.
CAV-2008-NguyenC #verification- Enhancing Program Verification with Lemmas (HHN, WNC), pp. 355–369.
- STOC-2007-RodlS #testing
- Property testing in hypergraphs and the removal lemma (VR, MS), pp. 488–495.
RTA-2006-GramlichL #linear #term rewriting- Generalizing Newman’s Lemma for Left-Linear Rewrite Systems (BG, SL), pp. 66–80.
SAT-2006-YuM #constraints #learning #linear #smt- Lemma Learning in SMT on Linear Constraints (YY, SM), pp. 142–155.
ITiCSE-2005-Gal-EzerT #automaton #challenge #education- Challenges in teaching the pumping lemma in automata theory course (JGE, MBT), p. 369.
SAT-2002-RuessM #satisfiability- Lemmas on demand for Satisfiability solvers (HR, LdM), p. 17.
DAC-2001-MajumdarW #combinator #satisfiability #using- Watermarking of SAT using Combinatorial Isolation Lemmas (RM, JLW), pp. 480–485.
- SAT-2001-SinzBK #implementation #named #parallel
- PaSAT — Parallel SAT-Checking with Lemma Exchange: Implementation and Applications (CS, WB, WK), pp. 205–216.
- STOC-2000-CzumajS #algorithm #approach #problem #satisfiability #scheduling
- A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) (AC, CS), pp. 38–47.
CADE-2000-HasegawaFK #branch #generative #performance #using- Efficient Minimal Model Generation Using Branching Lemmas (RH, HF, MK), pp. 184–199.
- STOC-1999-SudanTV #generative #pseudo
- Pseudorandom Generators Without the XOR Lemma (Extended Abstract) (MS, LT, SPV), pp. 537–546.
ICLP-1999-AppelF #lightweight #prolog- Lightweight Lemmas in λ-Prolog (AWA, APF), pp. 411–425.
- RTA-1999-Touzet #multi #recursion
- A Characterisation of Multiply Recursive Functions with Higman’s Lemma (HT), pp. 163–174.
FoSSaCS-1998-Beauquier #automaton- Pumping Lemmas for Timed Automata (DB), pp. 81–94.
- STOC-1998-MolloyR #algorithm #aspect-oriented
- Further Algorithmic Aspects of the Local Lemma (MM, BAR), pp. 524–529.
- ICALP-1998-Grolmusz
- A Degree-Decreasing Lemma for (MOD q — MOD p) Circuits (VG), pp. 215–222.
- CADE-1998-Fuchs #generative #similarity
- System Description: Similarity-Based Lemma Generation for Model Elimination (MF), pp. 33–37.
- STOC-1997-ImpagliazzoW #exponential
- P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma (RI, AW), pp. 220–229.
- CADE-1997-Iwanuma #proving #theorem proving #top-down
- Lemma Matching for a PTTP-based Top-down Theorem Prover (KI), pp. 146–160.
- CADE-1996-KapurS #automation #induction
- Lemma Discovery in Automated Induction (DK, MS), pp. 538–552.
- JICSLP-1996-CostantiniLM #semantics
- Asserting Lemmas in the Stable Model Semantics (SC, GAL, GM), pp. 438–452.
IWMM-1995-MatthewsS #distributed #garbage collection #memory management #named- LEMMA: A Distributed Shared Memory with Global and Local Garbage Collection (DCJM, TLS), pp. 297–311.
- RTA-1995-ChazarainM #automation #equation #named #recursion #source code #synthesis
- LEMMA: A System for Automated Synthesis of Recursive Programs in Equational Theories (JC, SM), pp. 420–425.
- RTA-1995-Kuper #proving #reduction
- Proving the Genericity Lemma by Leftmost Reduction is Simple (JK), pp. 271–278.
LOPSTR-1993-TarauB #delphi- Memoing with Abstract Answers and Delphi Lemmas (PT, KDB), pp. 196–209.
- ISLP-1991-Fribourg #automation #generative #induction #proving
- Automatic Generation of Simplification Lemmas for Inductive Proofs (LF), pp. 103–116.
- LICS-1990-MurthyR #proving
- A Constructive Proof of Higman’s Lemma (CRM, JRR), pp. 257–267.
GG-1978-Kreowski #graph- A Pumping Lemma for Context-Free Graph Languages (HJK), pp. 270–283.
