In this paper, we tackle the satisfiability problem for multi-context systems. First, we establish a satisfiability algorithm based on an encoding into propositional logic. Then, we propose a distributed decision procedure that maximally exploits the potential amenity of localizing reasoning and restricting it to relevant contexts. We show that the latter approach is computationally superior to our translation-based procedure, and outline how off-the-shelf efficient reasoning procedures can be used to implement our algorithm.