Central reasoning tasks arising in computational argumentation are NP-hard. The field of knowledge compilation studies formal representations that permit efficient reasoning, which, however, have so far not found their way into mainstream research in computational argumentation. We study how to compile parts of argumentation frameworks (AFs)—a central representation for argumentative reasoning—to binary decision diagrams (BDDs) in search-based algorithms. We show promise of compilation in an experimental evaluation of the resulting algorithms, which incorporate multiple heuristics.