We present a reflection principle for an arbitrary biased continuous time random walk (comprising both Markovian and non-Markovian processes) in the presence of a reflecting barrier on semi-infinite and finite chains. For biased walks in the presence of a reflecting barrier this principle (which cannot be derived from combinatorics) is completely different from its familiar form in the presence of an absorbing barrier.